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 30, 2026 04:34Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 20:50Andrew Epstein26.31CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 20:570567,293,549549,921,0008,520,0002,113,536expected "2106121 ", got "2097925 "
2Oct 15, 2026 20:570572,478,622552,655,0009,039,0002,113,536expected "2105645 ", got "2097449 "
3Oct 15, 2026 20:57026,372,0998,756,0008,813,0002,113,536expected "208 ", got "206 "
4Jan 30, 2026 04:3421,375727,294,123694,382,00010,990,0002,351,104
5Jan 30, 2026 04:3421,606744,956,540699,996,00012,999,0002,469,888
6Jan 30, 2026 04:3421,900751,852,624713,697,0008,996,0002,277,376