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 listAug 18, 2026 02:00Victor MerckléVictor MerckléScore: 1,975Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 02:031,95258,563,511143,574,0001,004,0002,170,880stderr
2Aug 18, 2026 02:031,95858,768,372143,624,0001,006,0002,170,880stderr
3Aug 18, 2026 02:031,95958,770,238146,250,0001,249,0002,170,880stderr
4Aug 18, 2026 02:031,97159,130,387145,674,0001,014,0002,170,880stderr
5Aug 18, 2026 02:031,97559,278,934146,564,0002,015,0002,170,880stderr
6Aug 18, 2026 02:031,97759,321,763148,004,0001,283,0002,170,880stderr
7Aug 18, 2026 02:032,53476,021,438178,927,0002,014,0002,170,880stderr
8Aug 18, 2026 02:032,67180,155,286190,736,0001,003,0002,170,880stderr
9Aug 18, 2026 02:032,89986,996,955195,889,0001,020,0002,170,880stderr