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 11, 2026 15:02Josu San MartinJosu San MartinScore: 4,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 15:014,600174,717,381148,815,0002,996,0002,404,352
2Jan 11, 2026 14:384,603172,275,118148,913,0002,998,0002,289,664
3Jan 11, 2026 15:014,603173,833,841150,888,000999,0002,289,664
4Jan 11, 2026 14:384,605182,227,762149,976,0001,999,0002,285,568
5Jan 11, 2026 14:384,610186,289,288149,126,0003,002,0002,289,664
6Jan 11, 2026 15:014,611178,815,300150,159,0002,002,0002,289,664
7Jan 11, 2026 15:024,755178,403,358154,929,0001,999,0002,289,664
8Jan 11, 2026 15:024,757178,932,298153,994,0002,999,0002,289,664
9Jan 11, 2026 15:024,758182,842,490156,027,0001,000,0002,392,064