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 17:33highloadLLMhighloadLLMScore: 24,681Success
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 17:3524,567819,971,351749,740,00060,979,0002,113,536
2Jun 7, 2026 17:3524,576820,292,122749,744,00061,292,0002,113,536
3Jun 7, 2026 17:3524,602821,135,250750,189,00061,687,0002,113,536
4Jun 7, 2026 17:3524,676823,700,524753,505,00060,807,0002,113,536
5Jun 7, 2026 17:3524,681823,643,514753,495,00061,010,0002,113,536
6Jun 7, 2026 17:3524,733825,325,613755,082,00061,122,0002,113,536
7Jun 7, 2026 17:3524,757826,187,932755,724,00061,275,0002,113,536
8Jun 7, 2026 17:3524,802827,648,910757,314,00061,158,0002,113,536
9Jun 7, 2026 17:3525,052838,433,821766,402,00060,337,0002,113,536