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 listJul 26, 2026 22:05Andrew TsibinAndrew TsibinScore: 14,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2026 22:0613,970419,111,546402,274,0006,329,0002,138,112
2Jul 26, 2026 22:0613,975419,265,960402,525,0006,323,0002,138,112
3Jul 26, 2026 22:0613,977419,310,811401,552,0007,334,0002,138,112
4Jul 26, 2026 22:0613,995419,852,998403,070,0006,263,0002,138,112
5Jul 26, 2026 22:0614,008420,244,651403,558,0006,250,0002,138,112
6Jul 26, 2026 22:0614,026420,789,437403,651,0006,548,0002,138,112
7Jul 26, 2026 22:0614,033421,017,652404,263,0006,295,0002,138,112
8Jul 26, 2026 22:0614,034421,046,505404,151,0006,395,0002,138,112
9Jul 26, 2026 22:0614,130423,919,583407,243,0006,162,0002,129,920