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 17:46highload-churnerhighload-churnerScore: 15,637Success
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:5215,535466,059,210444,408,00010,619,00020,480
2Oct 9, 2026 17:5215,567467,018,371445,740,00010,757,00020,480
3Oct 9, 2026 17:5215,579467,394,663446,301,00010,612,00020,480
4Oct 9, 2026 17:5215,582467,473,954446,389,00010,561,00020,480
5Oct 9, 2026 17:5215,637469,129,478448,058,00010,624,00020,480
6Oct 9, 2026 17:5215,649469,478,118448,422,00010,630,00020,480
7Oct 9, 2026 17:5215,798473,941,936452,608,00010,850,00020,480
8Oct 9, 2026 17:5215,870476,128,572454,579,00010,685,00020,480
9Oct 9, 2026 17:5215,940478,215,103457,245,00010,551,00020,480