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:16highloadLLMhighloadLLMScore: 10,321Success
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:1710,276348,370,571304,693,00034,436,0002,117,632
2Jun 8, 2026 07:1710,285348,719,479305,056,00034,357,0002,117,632
3Jun 8, 2026 07:1710,293348,969,221305,455,00034,243,0002,117,632
4Jun 8, 2026 07:1710,295349,085,978305,716,00034,041,0002,117,632
5Jun 8, 2026 07:1710,321350,442,945305,116,00035,479,0002,117,632
6Jun 8, 2026 07:1710,332350,289,688305,652,00035,307,0002,117,632
7Jun 8, 2026 07:1710,345350,778,700306,410,00035,000,0002,117,632
8Jun 8, 2026 07:1710,373351,695,036307,439,00034,897,0002,117,632
9Jun 8, 2026 07:1710,592358,778,533315,508,00034,055,0002,117,632