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 15, 2026 22:36Adam FolwarcznyAdam FolwarcznyScore: 11,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 22:3611,345398,987,088358,365,00016,016,0002,379,776
2Jan 15, 2026 22:3611,370403,038,420357,201,00018,010,0002,535,424
3Jan 15, 2026 22:3611,383403,460,903358,656,00016,983,0002,351,104
4Jan 15, 2026 22:3611,469400,038,838363,487,00014,978,0002,367,488
5Jan 15, 2026 22:3611,484403,443,867361,958,00016,998,0002,371,584
6Jan 15, 2026 22:3611,670410,550,303370,133,00014,964,0002,445,312
7Jan 15, 2026 22:3611,700412,911,905370,149,00015,963,0002,367,488
8Jan 15, 2026 22:3611,776416,581,302368,623,00019,979,0002,269,184
9Jan 15, 2026 22:3611,810420,443,500373,735,00015,988,0002,371,584