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 09:28Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:23Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 16:410119,882,193100,732,0008,063,00016,384No answer to stdout. Died or killed?
2Dec 19, 2025 09:286,273230,293,444202,011,0005,000,0002,301,952
3Dec 19, 2025 09:286,274234,864,063199,027,0008,001,0002,482,176
4Dec 19, 2025 09:286,279233,546,657201,198,0006,005,0002,478,080
5Dec 19, 2025 09:286,291236,928,467196,619,00010,978,0002,465,792
6Dec 19, 2025 09:286,292230,166,015199,635,0007,985,0002,523,136
7Dec 19, 2025 09:286,303237,524,483199,000,0009,000,0002,351,104
8Dec 19, 2025 09:286,305231,815,512202,068,0006,002,0002,445,312
9Dec 19, 2025 09:286,336233,522,017202,089,0007,003,0002,461,696
10Dec 19, 2025 09:286,338233,917,238201,141,0008,005,0002,527,232