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 20:45Andrew TsibinAndrew TsibinScore: 24,203Success
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 20:4624,081722,434,180706,574,0005,367,0002,138,112
2Jul 26, 2026 20:4624,135724,075,347708,195,0005,276,0002,138,112
3Jul 26, 2026 20:4624,149724,472,008708,865,0005,029,0002,138,112
4Jul 26, 2026 20:4624,161724,858,695709,249,0005,008,0002,138,112
5Jul 26, 2026 20:4624,203726,104,073709,492,0005,350,0002,138,112
6Jul 26, 2026 20:4624,205726,174,307710,371,0005,200,0002,117,632
7Jul 26, 2026 20:4624,283728,492,556712,727,0005,309,0002,129,920
8Jul 26, 2026 20:4624,362730,887,669716,326,0004,007,0002,117,632
9Jul 26, 2026 20:4624,575737,274,822721,359,0005,249,0002,117,632