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:48Andrew EpsteinAndrew EpsteinScore: 1,472Success
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:551,46043,818,269100,143,0001,148,0002,170,880stderr
2Oct 31, 2026 09:551,46243,871,546100,298,0001,087,0002,170,880stderr
3Oct 31, 2026 09:551,46443,940,897100,127,0001,190,0002,170,880stderr
4Oct 31, 2026 09:551,47044,113,807100,826,0001,109,0002,170,880stderr
5Oct 31, 2026 09:551,47244,185,955100,524,0001,126,0002,170,880stderr
6Oct 31, 2026 09:551,47444,239,815101,003,0001,126,0002,170,880stderr
7Oct 31, 2026 09:551,48144,430,374101,823,0001,170,0002,170,880stderr
8Oct 31, 2026 09:551,48144,432,095101,561,0001,109,0002,170,880stderr
9Oct 31, 2026 09:551,48644,598,451101,259,0001,090,0002,170,880stderr