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 12, 2026 04:05highload-churnerhighload-churnerScore: 9,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 04:069,255314,341,686262,453,00042,962,00024,576
2Oct 12, 2026 04:069,270314,875,586263,942,00041,991,00024,576
3Oct 12, 2026 04:069,312316,194,370264,416,00042,902,00024,576
4Oct 12, 2026 04:069,313316,239,627265,507,00041,846,00024,576
5Oct 12, 2026 04:069,378318,421,337266,671,00042,829,00024,576
6Oct 12, 2026 04:069,385318,701,256265,620,00044,115,00024,576
7Oct 12, 2026 04:069,465321,349,221267,805,00044,563,00024,576
8Oct 12, 2026 04:069,490322,165,763269,813,00043,364,00024,576
9Oct 12, 2026 04:069,548324,103,481272,219,00042,880,00024,576