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 11:39M-RochatM-RochatScore: 20,868Success
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 11:4020,666620,009,479605,934,0004,268,0002,113,536
2May 22, 2026 11:4020,727621,814,573607,449,0004,337,0002,113,536
3May 22, 2026 11:4020,811624,342,338610,393,0004,377,0002,113,536
4May 22, 2026 11:4020,846625,393,765610,692,0004,353,0002,113,536
5May 22, 2026 11:4020,868626,059,498610,982,0004,302,0002,113,536
6May 22, 2026 11:4021,003630,111,762614,145,0004,338,0002,113,536
7May 22, 2026 11:4021,065631,951,067615,878,0004,376,0002,113,536
8May 22, 2026 11:4021,069632,082,759614,409,0005,145,0002,113,536
9May 22, 2026 11:4021,118633,560,608616,868,0004,411,0002,113,536