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:27Andrew EpsteinAndrew EpsteinScore: 1,606Success
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:331,56947,071,071101,897,0001,013,0002,170,880
2Oct 31, 2026 02:331,57847,367,089101,440,0001,009,0002,170,880
3Oct 31, 2026 02:331,58947,679,509102,616,0001,005,0002,170,880
4Oct 31, 2026 02:331,59347,797,666102,979,0001,009,0002,170,880
5Oct 31, 2026 02:331,60648,180,641103,600,0001,208,0002,162,688
6Oct 31, 2026 02:331,61048,310,473102,963,0001,009,0002,170,880
7Oct 31, 2026 02:331,61348,402,201105,412,0001,194,0002,162,688
8Oct 31, 2026 02:331,63749,130,442103,757,0001,007,0002,170,880
9Oct 31, 2026 02:331,63949,184,017104,552,0001,004,0002,170,880