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 listJun 24, 2026 03:27Victor MerckléVictor MerckléScore: 3,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 03:283,08092,421,643240,236,0003,092,0002,654,208
2Jun 24, 2026 03:283,08492,529,987240,999,0003,041,0002,654,208
3Jun 24, 2026 03:283,08592,579,727241,663,0003,075,0002,654,208
4Jun 24, 2026 03:283,08792,612,977241,490,0003,113,0002,654,208
5Jun 24, 2026 03:283,09192,744,601241,059,0003,069,0002,650,112
6Jun 24, 2026 03:283,09892,955,329243,391,0003,108,0002,650,112
7Jun 24, 2026 03:283,11493,429,042243,144,0003,139,0002,650,112
8Jun 24, 2026 03:283,13193,936,766244,793,0003,131,0002,654,208
9Jun 24, 2026 03:283,16594,973,060242,812,0003,105,0002,654,208