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 9, 2026 19:53Josu San MartinJosu San MartinScore: 6,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 19:476,244238,350,138200,057,0006,001,0002,301,952
2Jan 9, 2026 19:476,252237,289,296203,296,0003,004,0002,383,872
3Jan 9, 2026 19:536,279243,328,710201,208,0006,006,0002,465,792
4Jan 9, 2026 19:476,302229,314,492203,959,0003,999,0002,379,776
5Jan 9, 2026 19:536,308230,002,479204,156,0004,003,0002,392,064
6Jan 9, 2026 19:536,385236,287,811205,704,0004,992,0002,387,968