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 listDec 19, 2025 20:09Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:24Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 16:540128,340,192114,399,0003,020,00016,384No answer to stdout. Died or killed?
2Dec 19, 2025 20:095,797219,881,994188,307,0003,004,0002,514,944
3Dec 19, 2025 20:095,815218,496,880185,904,0005,996,0002,347,008
4Dec 19, 2025 20:095,871214,618,554185,742,0007,988,0002,437,120
5Dec 19, 2025 20:095,873222,105,162186,807,0006,992,0002,281,472
6Dec 19, 2025 20:095,876221,654,909187,918,0005,997,0002,519,040
7Dec 19, 2025 20:095,892226,314,309189,411,0005,010,0002,387,968