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 7, 2026 21:31highloadLLMhighloadLLMError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 21:320849,910,062793,157,00047,598,0002,113,536expected "1018510 ", got "66,4343,69079,78602,78533,78915,78829,78956,79357,78620,78815,78639,78613,78441,78702,0 "
2Jun 7, 2026 21:320853,606,983796,677,00047,766,0002,113,536expected "1023222 ", got "65,4341,68984,78639,78941,79669,79229,79266,79285,79235,78759,79433,79168,79273,78935,0 "
3Jun 7, 2026 21:320856,624,186800,300,00047,039,0002,113,536expected "1021386 ", got "65,4347,68916,78679,79089,79287,79094,78861,79193,78930,78463,78926,79397,79007,79132,0 "