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 listJun 22, 2026 20:49Victor MerckléVictor MerckléScore: 5,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 20:495,372184,894,601141,481,00035,820,0002,113,536
2Jun 22, 2026 20:495,388185,830,155141,037,00036,794,0002,113,536
3Jun 22, 2026 20:495,389185,929,947141,000,00036,841,0002,113,536
4Jun 22, 2026 20:495,389185,902,760140,794,00037,050,0002,113,536
5Jun 22, 2026 20:495,390186,401,582140,888,00036,986,0002,113,536
6Jun 22, 2026 20:495,396186,777,769141,303,00036,775,0002,113,536
7Jun 22, 2026 20:495,403186,403,374141,294,00037,024,0002,113,536
8Jun 22, 2026 20:495,404186,172,050141,521,00036,827,0002,113,536
9Jun 22, 2026 20:495,453187,795,591143,047,00036,910,0002,113,536