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 13, 2026 04:20highload-churnerhighload-churnerScore: 4,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 04:234,178146,763,899136,613,0001,263,00020,480
2Oct 13, 2026 04:234,185146,930,622136,777,0001,332,00020,480
3Oct 13, 2026 04:234,187147,251,596136,883,0001,313,00020,480
4Oct 13, 2026 04:234,190147,280,281136,974,0001,311,00020,480
5Oct 13, 2026 04:234,194147,409,095137,108,0001,313,00020,480
6Oct 13, 2026 04:234,202147,606,485137,620,0001,053,00020,480
7Oct 13, 2026 04:234,203149,125,215137,392,0001,314,00020,480
8Oct 13, 2026 04:234,208147,820,362137,537,0001,328,00020,480
9Oct 13, 2026 04:234,221148,317,617137,970,0001,335,00020,480