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 23:39Andrew TsibinAndrew TsibinScore: 11,737Success
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 23:4011,713351,409,312335,224,0005,027,0002,138,112
2Jul 26, 2026 23:4011,720351,622,373335,741,0005,368,0002,138,112
3Jul 26, 2026 23:4011,733351,997,518335,206,0006,012,0002,138,112
4Jul 26, 2026 23:4011,735352,062,405335,841,0005,067,0002,138,112
5Jul 26, 2026 23:4011,737352,125,098335,914,0005,140,0002,138,112
6Jul 26, 2026 23:4011,748352,447,954336,426,0005,273,0002,138,112
7Jul 26, 2026 23:4011,759352,782,554337,196,0005,127,0002,138,112
8Jul 26, 2026 23:4011,780353,407,144337,831,0005,088,0002,138,112
9Jul 26, 2026 23:4011,800354,029,920334,861,0006,016,0002,138,112