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 3, 2026 18:53TudyMTudyMScore: 30,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 18:5530,062901,865,850873,907,00011,273,0002,560,000
2May 3, 2026 18:5530,129903,883,837874,167,00010,909,0002,564,096
3May 3, 2026 18:5530,168905,066,009876,588,0009,950,0002,543,616
4May 3, 2026 18:5530,243907,304,322880,855,0009,976,0002,555,904
5May 3, 2026 18:5530,306909,197,234880,220,0009,976,0002,543,616
6May 3, 2026 18:5530,354910,633,040883,619,00010,970,0002,555,904
7May 3, 2026 18:5530,359910,770,008882,560,0009,958,0002,551,808
8May 3, 2026 18:5530,455913,674,723881,627,00011,100,0002,551,808
9May 3, 2026 18:5530,780923,405,392894,450,00011,163,0002,543,616