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 24, 2025 20:04zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:16Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:16010,983,2651,632,0001,631,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 12:16011,382,2511,657,0001,657,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 12:16010,947,0961,583,0001,583,0002,121,728expected "16384 ", got "32 "stderr
4Dec 24, 2025 20:043,935154,914,007120,879,0008,991,0002,502,656
5Dec 24, 2025 20:043,959157,108,350120,676,0009,973,0002,437,120
6Dec 24, 2025 20:043,962153,180,888120,769,0009,980,0002,322,432