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:27highload-churnerhighload-churnerScore: 1,460Success
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:281,45043,506,754101,490,0000610,304
2Nov 8, 2026 05:281,45043,526,835101,540,0000610,304
3Nov 8, 2026 05:281,45343,594,423101,805,0000610,304
4Nov 8, 2026 05:281,45943,787,936102,243,0000352,256
5Nov 8, 2026 05:281,46043,808,737102,493,0000610,304
6Nov 8, 2026 05:281,48644,591,504102,688,0002,047,000610,304
7Nov 8, 2026 05:281,50045,013,938101,610,0003,111,000610,304
8Nov 8, 2026 05:281,50745,222,324103,419,0002,050,000606,208
9Nov 8, 2026 05:281,56446,928,814102,769,0002,063,000610,304