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 listOct 9, 2026 18:51highload-churnerhighload-churnerScore: 11,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 18:5410,429355,729,449299,758,00044,402,00020,480
2Oct 9, 2026 18:5410,863369,435,193312,608,00045,892,00020,480
3Oct 9, 2026 18:5411,064375,795,284317,974,00047,150,00020,480
4Oct 9, 2026 18:5411,182379,424,572321,771,00047,251,00020,480
5Oct 9, 2026 18:5411,323384,039,752325,325,00048,335,00020,480
6Oct 9, 2026 18:5411,428387,498,073328,381,00048,767,00020,480
7Oct 9, 2026 18:5411,447388,204,259329,117,00048,639,00020,480
8Oct 9, 2026 18:5411,470388,983,859330,010,00048,506,00020,480
9Oct 9, 2026 18:5411,539391,270,193332,644,00048,173,00020,480