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:09highloadLLMhighloadLLMScore: 10,253Success
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:1010,234347,110,071303,844,00033,908,0002,117,632
2Jun 8, 2026 09:1010,242347,200,359303,538,00034,458,0002,117,632
3Jun 8, 2026 09:1010,248347,515,120304,092,00034,124,0002,117,632
4Jun 8, 2026 09:1010,248347,944,483304,067,00034,134,0002,117,632
5Jun 8, 2026 09:1010,253347,905,628303,820,00034,554,0002,117,632
6Jun 8, 2026 09:1010,271348,556,633304,895,00034,074,0002,117,632
7Jun 8, 2026 09:1010,283348,908,543304,746,00034,610,0002,117,632
8Jun 8, 2026 09:1010,313349,650,573305,173,00035,176,0002,117,632
9Jun 8, 2026 09:1010,317349,749,288305,156,00035,305,0002,117,632