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 7, 2026 20:58highloadLLMhighloadLLMScore: 19,392Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 20:5919,242644,293,129596,405,00038,589,0002,113,536
2Jun 7, 2026 20:5919,290645,876,004597,568,00039,011,0002,113,536
3Jun 7, 2026 20:5919,357647,918,132599,442,00039,358,0002,113,536
4Jun 7, 2026 20:5919,385648,994,435600,452,00039,282,0002,113,536
5Jun 7, 2026 20:5919,392649,121,817601,377,00038,581,0002,113,536
6Jun 7, 2026 20:5919,419652,747,073601,138,00039,698,0002,113,536
7Jun 7, 2026 20:5919,571655,016,108606,445,00039,405,0002,113,536
8Jun 7, 2026 20:5919,571654,976,057606,401,00039,442,0002,113,536
9Jun 7, 2026 20:5919,606656,371,351608,650,00038,353,0002,113,536