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:38Andrew EpsteinAndrew EpsteinScore: 1,557Success
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:501,51745,513,400100,799,0001,006,0002,170,880
2Oct 31, 2026 02:501,52345,708,287101,338,0001,010,0002,170,880
3Oct 31, 2026 02:501,52345,711,552101,772,0001,019,0002,170,880
4Oct 31, 2026 02:501,54246,271,057101,980,0001,012,0002,170,880
5Oct 31, 2026 02:501,55746,736,549104,310,0001,020,0002,170,880
6Oct 31, 2026 02:501,57747,323,287105,038,0001,011,0002,170,880
7Oct 31, 2026 02:501,59147,743,750106,892,0001,016,0002,170,880
8Oct 31, 2026 02:501,59247,783,761107,168,0001,007,0002,170,880
9Oct 31, 2026 02:501,96859,065,607120,290,0001,019,0002,170,880