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:08highloadLLMhighloadLLMScore: 17,746Success
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:1017,456585,211,794537,658,00038,396,0002,113,536
2Jun 7, 2026 23:1017,624590,918,256543,947,00037,666,0002,113,536
3Jun 7, 2026 23:1017,659594,335,898544,233,00038,539,0002,113,536
4Jun 7, 2026 23:1017,679592,691,660545,390,00038,031,0002,113,536
5Jun 7, 2026 23:1017,746594,766,452547,693,00037,944,0002,113,536
6Jun 7, 2026 23:1017,835597,742,373550,267,00038,306,0002,113,536
7Jun 7, 2026 23:1017,929600,963,201553,189,00038,473,0002,113,536
8Jun 7, 2026 23:1018,071605,485,126558,316,00038,058,0002,113,536
9Jun 7, 2026 23:1018,163608,457,108559,883,00039,497,0002,113,536