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:02Andrew EpsteinAndrew EpsteinScore: 1,523Success
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:081,48944,683,576102,043,0001,014,0002,162,688
2Oct 31, 2026 03:081,50045,013,068102,988,0001,273,0002,162,688
3Oct 31, 2026 03:081,50545,176,679103,951,0001,011,0002,170,880
4Oct 31, 2026 03:081,51245,368,273104,336,0001,239,0002,162,688
5Oct 31, 2026 03:081,52345,702,988105,522,0001,016,0002,170,880
6Oct 31, 2026 03:081,52445,738,925105,739,0001,243,0002,162,688
7Oct 31, 2026 03:081,52545,777,840103,277,0003,111,0002,170,880
8Oct 31, 2026 03:081,54946,477,762104,038,0003,184,0002,170,880
9Oct 31, 2026 03:081,55446,623,625103,326,0001,298,0002,162,688