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 31, 2026 14:43Victor MerckléVictor MerckléScore: 1,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 14:451,69850,949,707120,617,0002,037,0002,170,880stderr
2Aug 31, 2026 14:451,70651,189,781120,575,0002,046,0002,170,880stderr
3Aug 31, 2026 14:451,72251,683,405120,314,0002,010,0002,170,880stderr
4Aug 31, 2026 14:451,72551,774,382121,062,0002,013,0002,170,880stderr
5Aug 31, 2026 14:451,73352,010,473120,599,0001,032,0002,170,880stderr
6Aug 31, 2026 14:451,73652,102,819120,471,0001,016,0002,170,880stderr
7Aug 31, 2026 14:451,73652,093,031121,245,0001,028,0002,170,880stderr
8Aug 31, 2026 14:451,74152,240,608121,216,0001,034,0002,170,880stderr
9Aug 31, 2026 14:451,79253,774,577122,074,0001,025,0002,170,880stderr