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:19Andrew EpsteinAndrew EpsteinScore: 1,491Success
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:211,46543,970,178100,285,0001,027,0002,170,880stderr
2Oct 31, 2026 06:211,48644,600,067102,437,0001,115,0002,170,880stderr
3Oct 31, 2026 06:211,48844,647,503101,860,0001,203,0002,170,880stderr
4Oct 31, 2026 06:211,48944,674,160101,865,0001,213,0002,162,688stderr
5Oct 31, 2026 06:211,49144,750,581102,096,0001,244,0002,170,880stderr
6Oct 31, 2026 06:211,49544,850,428102,995,0001,116,0002,170,880stderr
7Oct 31, 2026 06:211,49744,935,290103,506,0001,172,0002,170,880stderr
8Oct 31, 2026 06:211,50145,054,707103,243,0001,269,0002,170,880stderr
9Oct 31, 2026 06:211,51045,303,784104,583,0001,013,0002,162,688stderr