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 listNov 5, 2026 04:43e1011e1011Score: 29,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 04:4929,532985,540,732942,229,00032,349,0002,113,536
2Nov 5, 2026 04:4929,561986,953,902943,850,00031,681,0002,113,536
3Nov 5, 2026 04:4929,580987,054,704944,595,00031,557,0002,113,536
4Nov 5, 2026 04:4929,638989,144,938945,925,00032,145,0002,113,536
5Nov 5, 2026 04:4929,705991,869,488948,414,00031,851,0002,113,536
6Nov 5, 2026 04:4929,726991,962,876949,778,00031,192,0002,113,536
7Nov 5, 2026 04:4929,784993,924,717950,860,00032,044,0002,113,536
8Nov 5, 2026 04:4929,791994,285,535950,912,00032,191,0002,113,536
9Nov 5, 2026 04:4929,851996,635,380953,669,00031,442,0002,113,536