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 07:41highloadLLMhighloadLLMScore: 10,616Success
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 07:4210,579358,428,887315,099,00034,011,0002,117,632
2Jun 8, 2026 07:4210,596359,383,204315,124,00034,570,0002,117,632
3Jun 8, 2026 07:4210,596359,118,821315,120,00034,580,0002,117,632
4Jun 8, 2026 07:4210,616359,674,474315,976,00034,364,0002,117,632
5Jun 8, 2026 07:4210,616359,642,800315,156,00035,198,0002,117,632
6Jun 8, 2026 07:4210,619359,717,258316,033,00034,423,0002,117,632
7Jun 8, 2026 07:4210,622359,736,917315,984,00034,542,0002,117,632
8Jun 8, 2026 07:4210,632360,177,963316,150,00034,724,0002,117,632
9Jun 8, 2026 07:4210,656361,022,023315,552,00036,118,0002,117,632