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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:45Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:46011,537,0551,835,0001,835,0002,121,728expected "16384 ", got "494 "stderr
2Jul 5, 2026 12:46011,766,1631,831,0001,831,0002,121,728expected "16384 ", got "494 "stderr
3Jul 5, 2026 12:46011,525,3861,851,0001,851,0002,121,728expected "16384 ", got "494 "stderr
4Dec 25, 2025 22:063,920152,052,070122,327,0007,018,0002,428,928
5Dec 25, 2025 22:064,004156,302,643121,136,00011,012,0002,334,720
6Dec 25, 2025 22:064,408173,320,162129,415,00016,051,0002,392,064