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 23:31highloadLLMhighloadLLMScore: 19,058Success
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 23:3218,574622,194,310574,852,00038,122,0002,113,536
2Jun 7, 2026 23:3218,828631,786,645582,394,00038,954,0002,113,536
3Jun 7, 2026 23:3218,987635,743,981588,624,00037,964,0002,113,536
4Jun 7, 2026 23:3219,008636,406,099589,358,00037,913,0002,113,536
5Jun 7, 2026 23:3219,058638,076,211589,612,00039,310,0002,113,536
6Jun 7, 2026 23:3219,061638,222,144591,020,00038,008,0002,113,536
7Jun 7, 2026 23:3219,099639,348,955591,072,00039,225,0002,113,536
8Jun 7, 2026 23:3219,127640,292,820593,064,00038,137,0002,113,536
9Jun 7, 2026 23:3219,302646,206,929599,150,00037,833,0002,113,536