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 21:41highloadLLMhighloadLLMScore: 18,956Success
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 21:4518,762628,333,197580,479,00038,667,0002,113,536
2Jun 7, 2026 21:4518,789629,272,517581,605,00038,438,0002,113,536
3Jun 7, 2026 21:4518,859631,584,760583,955,00038,402,0002,113,536
4Jun 7, 2026 21:4518,877632,233,612584,112,00038,830,0002,113,536
5Jun 7, 2026 21:4518,956634,917,807587,068,00038,492,0002,113,536
6Jun 7, 2026 21:4518,958634,742,863586,528,00039,110,0002,113,536
7Jun 7, 2026 21:4519,001636,143,543587,888,00039,155,0002,113,536
8Jun 7, 2026 21:4519,033637,291,386589,423,00038,693,0002,113,536
9Jun 7, 2026 21:4519,131640,474,753592,473,00038,856,0002,113,536