Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listApr 28, 2026 18:05Victor MerckléVictor MerckléScore: 7,081Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 18:066,823204,706,852488,962,00049,996,0002,650,112
2Apr 28, 2026 18:066,847205,422,827492,640,00047,061,0002,543,616
3Apr 28, 2026 18:066,938208,162,643493,576,00042,963,0002,547,712
4Apr 28, 2026 18:066,959208,792,037491,877,00039,990,0002,744,320
5Apr 28, 2026 18:067,081212,456,281489,709,00038,055,0002,674,688
6Apr 28, 2026 18:067,129213,870,763494,097,00051,010,0002,600,960
7Apr 28, 2026 18:067,129213,876,364497,436,00045,039,0002,715,648
8Apr 28, 2026 18:067,251217,534,533506,468,00040,957,0002,666,496
9Apr 28, 2026 18:067,341220,248,612491,620,00043,054,0002,781,184