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 09:45Andrew EpsteinAndrew EpsteinScore: 1,556Success
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 09:541,54146,232,345100,604,0002,032,0002,187,264stderr
2Oct 31, 2026 09:541,54746,415,470100,872,0002,137,0002,183,168stderr
3Oct 31, 2026 09:541,54846,466,085100,789,0002,034,0002,179,072stderr
4Oct 31, 2026 09:541,55346,617,921102,695,0001,011,0002,179,072stderr
5Oct 31, 2026 09:541,55646,682,303101,696,0002,043,0002,179,072stderr
6Oct 31, 2026 09:541,56346,915,411102,161,0002,079,0002,191,360stderr
7Oct 31, 2026 09:541,60348,108,612101,663,0002,065,0002,179,072stderr
8Oct 31, 2026 09:541,66650,005,534102,038,0002,063,0002,183,168stderr
9Oct 31, 2026 09:541,97859,343,800106,841,0002,038,0002,179,072stderr