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 21, 2026 17:44M-RochatM-RochatScore: 21,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:4420,929627,889,243614,123,0004,127,0002,113,536
2May 21, 2026 17:4421,006630,183,285613,791,0004,132,0002,113,536
3May 21, 2026 17:4421,030630,918,489613,509,0005,147,0002,113,536
4May 21, 2026 17:4421,036631,105,137617,332,0004,206,0002,113,536
5May 21, 2026 17:4421,057631,727,081617,340,0004,158,0002,113,536
6May 21, 2026 17:4421,278638,353,523622,462,0004,181,0002,113,536
7May 21, 2026 17:4421,349640,483,021623,801,0004,202,0002,113,536
8May 21, 2026 17:4421,431642,950,533627,106,0004,179,0002,113,536
9May 21, 2026 17:4422,387671,622,618655,218,0004,021,0002,113,536