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 04:35highloadLLMhighloadLLMScore: 12,915Success
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 04:3612,885434,349,554357,099,00068,120,0002,113,536
2Jun 8, 2026 04:3612,891434,443,877355,837,00069,567,0002,113,536
3Jun 8, 2026 04:3612,906435,238,356356,773,00069,128,0002,113,536
4Jun 8, 2026 04:3612,914435,415,771356,517,00069,654,0002,113,536
5Jun 8, 2026 04:3612,915435,464,453358,093,00068,130,0002,113,536
6Jun 8, 2026 04:3612,917435,289,372357,472,00068,821,0002,113,536
7Jun 8, 2026 04:3612,920435,511,049357,427,00068,947,0002,113,536
8Jun 8, 2026 04:3612,921435,538,960357,646,00068,756,0002,113,536
9Jun 8, 2026 04:3612,941436,133,681357,812,00069,242,0002,113,536