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 listJun 16, 2026 03:02Victor MerckléVictor MerckléScore: 3,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 03:033,06992,083,446240,215,0003,038,0002,654,208
2Jun 16, 2026 03:033,07592,251,062241,291,0003,128,0002,654,208
3Jun 16, 2026 03:033,08692,582,057241,751,0003,053,0002,654,208
4Jun 16, 2026 03:033,09392,797,844243,176,0002,026,0002,650,112
5Jun 16, 2026 03:033,09692,881,013243,488,0003,143,0002,654,208
6Jun 16, 2026 03:033,09792,910,045241,871,0003,107,0002,650,112
7Jun 16, 2026 03:033,10493,132,931243,276,0003,043,0002,650,112
8Jun 16, 2026 03:033,12993,899,028245,640,0002,040,0002,654,208
9Jun 16, 2026 03:033,16594,964,157246,428,0002,070,0002,654,208