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:27highload-churnerhighload-churnerScore: 6,596Success
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:286,481194,437,362506,494,0009,969,000200,704
2Oct 16, 2026 11:286,490194,711,612508,141,00010,058,000204,800
3Oct 16, 2026 11:286,525195,767,596505,183,0009,974,000204,800
4Oct 16, 2026 11:286,536196,097,763506,049,0009,962,000196,608
5Oct 16, 2026 11:286,596197,883,789508,749,0009,931,000200,704
6Oct 16, 2026 11:286,681200,457,397510,229,00010,067,000196,608
7Oct 16, 2026 11:286,698200,959,685513,870,00010,093,000204,800
8Oct 16, 2026 11:287,022210,688,719512,506,00010,010,000192,512
9Oct 16, 2026 11:287,134214,025,338515,809,0009,991,000200,704