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 08:13highload-churnerhighload-churnerScore: 19,543Success
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 09:0219,450652,382,173629,314,00012,536,00020,480
2Oct 9, 2026 09:0219,482654,141,763630,270,00012,648,00020,480
3Oct 9, 2026 09:0219,526654,989,334631,690,00012,696,00020,480
4Oct 9, 2026 09:0219,526655,116,538631,671,00012,694,00020,480
5Oct 9, 2026 09:0219,543655,586,465632,030,00012,895,00020,480
6Oct 9, 2026 09:0219,568657,011,856633,113,00012,637,00020,480
7Oct 9, 2026 09:0219,857666,538,166642,597,00012,690,00020,480
8Oct 9, 2026 09:0219,868666,820,892643,002,00012,643,00020,480
9Oct 9, 2026 09:0219,888666,896,074643,770,00012,555,00020,480