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 03:06zielajzielajScore: 3,162Success
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 03:063,146128,514,386101,832,0001,996,0002,404,352
2Jan 7, 2026 03:093,148130,546,060101,876,0001,997,0002,408,448
3Jan 7, 2026 03:093,161128,914,796102,322,0002,006,0002,404,352
4Jan 7, 2026 03:063,162126,170,379103,349,0001,003,0002,400,256
5Jan 7, 2026 03:093,188129,568,973102,184,0003,005,0002,273,280
6Jan 7, 2026 03:063,356135,909,707109,765,000997,0002,535,424