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 listJan 10, 2026 16:59Josu San MartinJosu San MartinScore: 55,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 17:227,297218,901,353190,177,0005,974,0002,609,152
2Jan 10, 2026 17:227,388221,651,519189,214,0007,966,0002,580,480
3Jan 10, 2026 17:227,630228,906,329190,615,0005,987,0002,633,728
4Jan 10, 2026 16:5955,7741,673,229,7511,641,978,0005,992,0002,609,152
5Jan 10, 2026 16:5955,8291,674,868,3221,643,951,0006,991,0002,519,040
6Jan 10, 2026 16:5955,9621,678,869,4741,641,296,0007,991,0002,826,240