Unique strings Sergey Svistunov

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 14, 2026 01:42Josu San MartinJosu San MartinScore: 4,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 14, 2026 01:374,331167,087,522141,918,000999,0002,392,064
2Jan 14, 2026 01:374,331163,012,328140,929,0001,998,0002,400,256
3Jan 14, 2026 01:374,336165,203,055141,095,0002,001,0002,293,760
4Jan 14, 2026 01:424,339165,854,313142,186,0001,001,0002,285,568
5Jan 14, 2026 01:424,341168,349,399142,258,0001,001,0002,293,760
6Jan 14, 2026 01:424,344175,403,259142,338,0001,002,0002,396,160