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 12, 2025 14:38Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 20:34Andrew Epstein16.05CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 20:420107,611,17690,478,0006,487,00016,384Exit with code 1:
2Dec 12, 2025 14:3811,409406,666,590368,506,0007,989,0002,510,848
3Dec 12, 2025 14:3811,426406,110,446367,045,00010,001,0002,506,752
4Dec 12, 2025 14:3811,428406,088,693368,130,0009,003,0002,506,752
5Dec 12, 2025 14:3811,459405,758,842369,141,0009,003,0002,338,816
6Dec 12, 2025 14:3811,467407,241,884371,417,0007,007,0002,420,736
7Dec 12, 2025 14:3811,471405,582,963367,542,00010,986,0002,420,736
8Dec 12, 2025 14:3811,501406,700,491369,532,0009,987,0002,494,464
9Dec 12, 2025 14:3811,522407,024,011371,218,0009,005,0002,498,560
10Dec 12, 2025 14:3811,720413,524,317377,753,0008,994,0002,383,872