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 9, 2026 18:09highload-churnerhighload-churnerScore: 15,335Success
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 18:1015,268458,043,898436,777,00010,771,00020,480
2Oct 9, 2026 18:1015,292458,783,503437,673,00010,662,00020,480
3Oct 9, 2026 18:1015,305459,166,558438,065,00010,685,00020,480
4Oct 9, 2026 18:1015,328459,867,571438,227,00011,120,00020,480
5Oct 9, 2026 18:1015,335460,075,294438,953,00010,623,00020,480
6Oct 9, 2026 18:1015,347460,438,220439,064,00010,912,00020,480
7Oct 9, 2026 18:1015,388461,661,388438,933,00010,767,00020,480
8Oct 9, 2026 18:1015,422462,674,991439,522,00010,987,00020,480
9Oct 9, 2026 18:1015,926477,792,927448,513,00010,705,00020,480