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 listJun 25, 2025 02:08Ian MckibbenIan MckibbenError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:18M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:48028,493,37712,716,0006,507,0002,113,536expected "1000000 ", got "4095"
2May 17, 2026 14:48026,670,75412,631,0006,627,0002,113,536expected "1000000 ", got "4095"
3May 17, 2026 14:48028,744,67312,687,0006,485,0002,113,536expected "1000000 ", got "4095"
4Jun 25, 2025 02:0814,972516,097,759427,057,00067,009,0002,383,872
5Jun 25, 2025 02:0814,980518,981,668417,449,00076,898,0002,310,144
6Jun 25, 2025 02:0815,004520,852,120409,107,00086,022,0002,338,816