Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 16, 2026 04:48highload-churnerhighload-churnerScore: 7,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 04:497,671230,153,871608,379,0004,267,000159,744
2Oct 16, 2026 04:497,710231,327,677611,920,0004,131,000163,840
3Oct 16, 2026 04:497,778233,360,200610,524,0004,270,000151,552
4Oct 16, 2026 04:497,800234,003,541619,176,0004,380,000155,648
5Oct 16, 2026 04:497,832234,985,242622,411,0004,358,000163,840
6Oct 16, 2026 04:497,884236,544,884611,318,0004,161,000167,936
7Oct 16, 2026 04:497,922237,682,553611,974,0004,205,000155,648
8Oct 16, 2026 04:497,953238,598,405617,547,0004,086,000151,552
9Oct 16, 2026 04:497,956238,705,961621,121,0005,114,000159,744