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 16:48highload-churnerhighload-churnerScore: 14,024Success
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 17:0213,906469,610,460448,116,00010,794,00020,480
2Oct 9, 2026 17:0213,955471,010,916449,829,00010,691,00020,480
3Oct 9, 2026 17:0213,962471,267,312449,963,00010,793,00020,480
4Oct 9, 2026 17:0214,004472,607,294451,543,00010,616,00020,480
5Oct 9, 2026 17:0214,024473,331,941452,225,00010,595,00020,480
6Oct 9, 2026 17:0214,073474,742,996453,821,00010,588,00020,480
7Oct 9, 2026 17:0214,174479,732,845456,597,00011,157,00020,480
8Oct 9, 2026 17:0214,181478,575,593457,124,00010,871,00020,480
9Oct 9, 2026 17:0214,286481,990,263460,244,00011,202,00020,480