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:32highloadLLMhighloadLLMScore: 10,385Success
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:3310,332350,720,069307,394,00033,590,0002,117,632
2Jun 8, 2026 07:3310,342350,479,244307,184,00034,132,0002,113,536
3Jun 8, 2026 07:3310,353351,303,174306,911,00034,765,0002,113,536
4Jun 8, 2026 07:3310,363351,345,991307,920,00034,085,0002,117,632
5Jun 8, 2026 07:3310,385351,961,425308,205,00034,514,0002,117,632
6Jun 8, 2026 07:3310,386352,347,775307,926,00034,837,0002,117,632
7Jun 8, 2026 07:3310,393352,279,165308,123,00034,868,0002,117,632
8Jun 8, 2026 07:3310,403352,789,472307,494,00035,830,0002,117,632
9Jun 8, 2026 07:3310,447354,103,526308,289,00036,491,0002,117,632