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 06:36Andrew EpsteinAndrew EpsteinScore: 1,480Success
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 06:451,43242,964,41297,599,0001,250,0002,170,880stderr
2Oct 31, 2026 06:451,46443,934,285100,472,0001,203,0002,162,688stderr
3Oct 31, 2026 06:451,47044,109,165101,408,0001,017,0002,170,880stderr
4Oct 31, 2026 06:451,47744,335,552102,006,0001,102,0002,170,880stderr
5Oct 31, 2026 06:451,48044,418,890102,326,0001,085,0002,162,688stderr
6Oct 31, 2026 06:451,49844,956,319103,330,0001,197,0002,162,688stderr
7Oct 31, 2026 06:451,50245,078,247104,272,0001,030,0002,170,880stderr
8Oct 31, 2026 06:451,50745,213,575104,367,0001,262,0002,170,880stderr
9Oct 31, 2026 06:451,57447,223,333106,631,0001,025,0002,162,688stderr