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 listMay 22, 2026 19:34M-RochatM-RochatScore: 21,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 19:3520,330609,924,716596,345,0004,065,0002,113,536
2May 22, 2026 19:3520,348610,449,379596,712,0004,080,0002,113,536
3May 22, 2026 19:3520,391611,747,589596,879,0004,019,0002,113,536
4May 22, 2026 19:3521,228636,844,774621,633,0004,154,0002,113,536
5May 22, 2026 19:3521,655649,662,871635,781,0004,188,0002,113,536
6May 22, 2026 19:3521,670650,122,095634,473,0006,124,0002,113,536
7May 22, 2026 19:3522,004660,136,037645,035,0005,069,0002,113,536
8May 22, 2026 19:3522,025660,779,883646,685,0004,259,0002,113,536
9May 22, 2026 19:3522,041661,237,997644,156,0005,009,0002,113,536