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 listNov 8, 2026 05:44highload-churnerhighload-churnerScore: 1,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 05:451,44143,255,068100,717,0000339,968
2Nov 8, 2026 05:451,44543,359,116101,313,0000339,968
3Nov 8, 2026 05:451,44943,472,923101,465,000073,728
4Nov 8, 2026 05:451,45143,544,077101,575,0000327,680
5Nov 8, 2026 05:451,45343,600,304101,871,000073,728
6Nov 8, 2026 05:451,45343,590,909101,728,0000327,680
7Nov 8, 2026 05:451,45543,662,872101,779,0000339,968
8Nov 8, 2026 05:451,45843,768,158102,318,0000339,968
9Nov 8, 2026 05:451,46443,936,223100,857,0002,082,000339,968