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 15:12zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 10:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 10:43011,688,4372,643,0001,322,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 10:43012,076,8922,642,0001,321,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 10:43011,677,4852,645,0001,322,0002,121,728expected "16384 ", got "349 "stderr
4Dec 26, 2025 15:123,820148,522,024113,068,00013,007,0002,383,872
5Dec 26, 2025 15:123,848159,468,621109,981,00016,997,0002,367,488
6Dec 26, 2025 15:123,872155,699,101114,799,00012,977,0002,355,200