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 31, 2026 17:34olliecrowolliecrowScore: 29,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 17:3428,966983,521,709939,883,00015,998,0002,412,544
2Jan 31, 2026 17:3429,032983,600,605943,059,00015,000,0002,285,568
3Jan 31, 2026 17:3429,223989,895,340948,355,00015,989,0002,273,280
4Jan 31, 2026 17:3429,272993,624,480950,963,00014,999,0002,260,992
5Jan 31, 2026 17:3429,296989,397,005950,772,00015,996,0002,408,448
6Jan 31, 2026 17:3429,341995,830,719952,267,00015,987,0002,273,280