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 listMar 21, 2026 19:57olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 19:21Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 19:280173,285,816154,386,0007,843,0002,174,976expected "2101289 ", got "2068670 "
2Oct 15, 2026 19:280186,039,743165,221,00010,199,0002,134,016expected "2102791 ", got "2070169 "
3Oct 15, 2026 19:2826320,078,5326,479,0002,216,0002,138,112
4Mar 21, 2026 19:5713,052459,706,565420,717,0009,993,0002,383,872
5Mar 21, 2026 19:5713,429483,566,125431,190,00011,977,0002,416,640
6Mar 21, 2026 19:5714,075490,257,882450,505,00013,984,0002,478,080