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 11:50highload-churnerhighload-churnerScore: 6,446Success
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 11:516,390191,715,247508,075,00010,044,000172,032
2Oct 16, 2026 11:516,399191,973,113508,642,00010,047,000167,936
3Oct 16, 2026 11:516,399191,977,358507,782,0009,991,000172,032
4Oct 16, 2026 11:516,407192,239,735507,928,00010,047,000172,032
5Oct 16, 2026 11:516,446193,386,925508,672,0009,936,000172,032
6Oct 16, 2026 11:516,447193,433,237507,169,0009,980,000167,936
7Oct 16, 2026 11:516,457193,711,328507,471,00010,026,000167,936
8Oct 16, 2026 11:516,500195,027,160510,459,00010,052,000172,032
9Oct 16, 2026 11:516,714201,445,527522,397,0009,980,000167,936