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 listSep 1, 2026 06:45Victor MerckléVictor MerckléScore: 1,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:471,69250,785,490120,956,0001,275,0002,170,880stderr
2Sep 1, 2026 06:471,69950,999,421120,657,0001,031,0002,170,880stderr
3Sep 1, 2026 06:471,70551,154,904122,272,0001,267,0002,170,880stderr
4Sep 1, 2026 06:471,71351,416,166121,528,0001,020,0002,170,880stderr
5Sep 1, 2026 06:471,72251,679,586122,654,0001,036,0002,170,880stderr
6Sep 1, 2026 06:471,73051,921,301121,712,0001,033,0002,170,880stderr
7Sep 1, 2026 06:471,74052,217,696121,124,0002,006,0002,170,880stderr
8Sep 1, 2026 06:471,74952,492,450121,210,0001,031,0002,170,880stderr
9Sep 1, 2026 06:472,07662,285,006129,748,0002,050,0002,170,880stderr