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 03:41Andrew EpsteinAndrew EpsteinScore: 1,511Success
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 03:421,46944,071,207101,173,0001,209,0002,162,688
2Oct 31, 2026 03:421,50245,082,957103,945,0001,281,0002,170,880
3Oct 31, 2026 03:421,50545,155,386104,394,0001,245,0002,170,880
4Oct 31, 2026 03:421,50645,187,029104,760,0001,206,0002,170,880
5Oct 31, 2026 03:421,51145,347,059104,830,0001,227,0002,162,688
6Oct 31, 2026 03:421,51745,517,262105,435,0001,232,0002,170,880
7Oct 31, 2026 03:421,53145,932,760106,787,0001,212,0002,170,880
8Oct 31, 2026 03:421,53546,053,579102,616,0001,281,0002,170,880
9Oct 31, 2026 03:421,55446,629,919103,106,0001,222,0002,170,880