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 26, 2025 20:39zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 09:35Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 09:36012,627,4402,189,0002,494,0002,121,728expected "16384 ", got "787 "stderr
2Jul 5, 2026 09:36012,202,8892,127,0002,176,0002,121,728expected "16384 ", got "787 "stderr
3Jul 5, 2026 09:36012,168,0022,141,0002,221,0002,121,728expected "16384 ", got "787 "stderr
4Dec 26, 2025 20:393,766148,575,081117,258,0007,015,0002,383,872
5Dec 26, 2025 20:393,778153,323,645116,709,0007,980,0002,371,584
6Dec 26, 2025 20:393,794151,615,535106,185,00019,033,0002,387,968