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 listOct 13, 2026 04:55highload-churnerhighload-churnerScore: 3,546Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 19:18Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 04:563,532125,485,106115,543,0001,023,00020,480
2Oct 13, 2026 04:563,534125,637,562115,381,0001,244,00020,480
3Oct 13, 2026 04:563,539125,671,019115,573,0001,243,00020,480
4Oct 13, 2026 04:563,545125,970,874115,958,0001,057,00020,480
5Oct 13, 2026 04:563,546125,929,862115,729,0001,317,00020,480
6Oct 13, 2026 04:563,553126,271,726115,973,0001,276,00020,480
7Oct 13, 2026 04:563,554126,138,534116,046,0001,251,00020,480
8Oct 13, 2026 04:563,566126,657,563116,378,0001,315,00020,480
9Oct 13, 2026 04:563,570126,776,959116,501,0001,326,00020,480