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 8, 2026 09:03highloadLLMhighloadLLMScore: 10,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 09:0410,207346,607,131303,316,00033,537,0002,117,632
2Jun 8, 2026 09:0410,224346,673,486303,755,00033,650,0002,117,632
3Jun 8, 2026 09:0410,233346,980,038303,935,00033,767,0002,117,632
4Jun 8, 2026 09:0410,247347,399,157303,817,00034,342,0002,117,632
5Jun 8, 2026 09:0410,252347,632,375303,875,00034,450,0002,117,632
6Jun 8, 2026 09:0410,264347,987,588304,604,00034,122,0002,113,536
7Jun 8, 2026 09:0410,265347,971,699305,011,00033,763,0002,117,632
8Jun 8, 2026 09:0410,267348,117,650304,694,00034,144,0002,117,632
9Jun 8, 2026 09:0410,271348,203,462303,268,00035,703,0002,117,632