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 21, 2025 03:13izotoffizotoffScore: 29,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 03:1328,592857,773,486825,267,0006,993,0002,527,232
2Nov 21, 2025 03:1328,818864,550,478830,477,0006,995,0002,756,608
3Nov 21, 2025 03:1328,939868,179,099837,495,0005,996,0002,756,608
4Nov 21, 2025 03:1328,974869,213,825831,121,0006,000,0002,646,016
5Nov 21, 2025 03:1329,015870,435,790833,808,0004,998,0002,535,424
6Nov 21, 2025 03:1329,471884,130,406847,561,0004,997,0002,695,168
7Nov 21, 2025 03:1329,567887,013,289856,809,0006,998,0002,609,152
8Nov 21, 2025 03:1329,788893,636,962863,548,0005,996,0002,756,608
9Nov 21, 2025 03:1330,057901,711,818874,626,0004,997,0002,756,608