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 listJan 15, 2026 23:21Adam FolwarcznyAdam FolwarcznyError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 19:35Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 19:45027,474,59315,178,0003,327,0002,121,728expected "19716 ", got "15771 "stderr
2Oct 15, 2026 19:45259,504,270830,00002,121,728stderr
3Oct 15, 2026 19:45299,726,907963,00002,121,728stderr
4Jan 15, 2026 23:219,684350,354,042314,567,0005,009,0002,433,024
5Jan 15, 2026 23:219,764344,186,557317,209,0005,003,0002,469,888
6Jan 15, 2026 23:2110,112354,854,153329,690,0003,996,0002,531,328