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 25, 2025 22:01zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 09:57Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 09:58011,024,5551,650,0001,649,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 09:58010,935,4141,582,0001,581,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 09:58011,038,5341,641,0001,640,0002,121,728expected "16384 ", got "32 "stderr
4Dec 25, 2025 22:013,778152,609,985114,714,0009,975,0002,396,160
5Dec 25, 2025 22:013,812150,663,323115,819,0009,984,0002,314,240
6Dec 25, 2025 22:013,817151,074,719112,979,00012,997,0002,375,680