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 listOct 31, 2026 02:26Andrew EpsteinAndrew EpsteinScore: 1,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 02:311,51345,398,738101,359,0001,016,0002,166,784stderr
2Oct 31, 2026 02:311,51445,427,014100,314,0001,093,0002,174,976stderr
3Oct 31, 2026 02:311,53245,982,946102,610,0002,056,0002,166,784stderr
4Oct 31, 2026 02:311,53346,013,340101,881,0002,040,0002,166,784stderr
5Oct 31, 2026 02:311,53746,134,507101,820,0001,025,0002,174,976stderr
6Oct 31, 2026 02:311,54946,473,904104,806,0001,008,0002,166,784stderr
7Oct 31, 2026 02:311,57447,227,012105,735,0001,010,0002,174,976stderr
8Oct 31, 2026 02:311,57847,360,362100,012,0001,041,0002,174,976stderr
9Oct 31, 2026 02:311,58447,529,668108,195,0001,022,0002,166,784stderr