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 05:44Andrew EpsteinAndrew EpsteinScore: 1,505Success
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 05:461,46543,954,808100,564,0001,097,0002,170,880stderr
2Oct 31, 2026 05:461,47644,293,953101,750,0001,013,0002,170,880stderr
3Oct 31, 2026 05:461,49344,804,692102,486,0001,181,0002,170,880stderr
4Oct 31, 2026 05:461,50245,083,649103,800,0001,131,0002,170,880stderr
5Oct 31, 2026 05:461,50545,159,048104,030,0001,095,0002,170,880stderr
6Oct 31, 2026 05:461,50845,251,510104,312,0001,175,0002,170,880stderr
7Oct 31, 2026 05:461,51045,317,778104,424,0001,231,0002,170,880stderr
8Oct 31, 2026 05:461,51145,358,154104,276,0001,190,0002,170,880stderr
9Oct 31, 2026 05:461,56847,051,697105,127,0001,182,0002,170,880stderr