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 listJan 8, 2026 19:53Павел РатмановПавел РатмановScore: 20,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 19:5320,186605,566,2981,663,225,00011,994,0002,588,672
2Jan 8, 2026 19:5320,236607,072,8191,663,354,00012,987,0002,322,432
3Jan 8, 2026 19:5320,247607,418,5651,675,095,00011,993,0002,793,472
4Jan 8, 2026 19:5320,265607,946,7601,670,513,00010,990,0002,584,576
5Jan 8, 2026 19:5320,283608,478,1471,661,817,00013,981,0002,748,416
6Jan 8, 2026 19:5320,288608,641,0871,665,493,00011,996,0002,805,760
7Jan 8, 2026 19:5320,610618,301,5821,707,263,00011,980,0002,588,672
8Jan 8, 2026 19:5320,805624,156,1521,724,448,00011,989,0002,670,592
9Jan 8, 2026 19:5321,032630,964,7371,729,719,00014,988,0002,842,624