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 7, 2026 22:13Josu San MartinJosu San MartinScore: 23,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 22:1323,667810,838,068777,007,0004,000,0002,289,664
2Jan 7, 2026 22:1323,689808,174,895776,751,0004,998,0002,465,792
3Jan 7, 2026 22:1323,816814,031,324780,932,0004,999,0002,326,528
4Jan 7, 2026 22:1323,940823,199,766785,014,0005,000,0002,334,720
5Jan 7, 2026 22:1323,966823,346,056785,886,0004,999,0002,289,664
6Jan 7, 2026 22:1324,303825,607,836798,007,0004,000,0002,334,720