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 24, 2026 09:13Victor MerckléVictor MerckléScore: 1,693Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 09:141,67750,323,259119,211,0001,008,0002,170,880stderr
2Aug 24, 2026 09:141,68650,590,490118,883,0002,007,0002,170,880stderr
3Aug 24, 2026 09:141,68750,618,370119,390,0002,015,0002,170,880stderr
4Aug 24, 2026 09:141,69050,705,030120,446,0002,015,0002,170,880stderr
5Aug 24, 2026 09:141,69350,817,066119,624,0002,023,0002,170,880stderr
6Aug 24, 2026 09:141,69550,864,427118,150,0002,006,0002,170,880stderr
7Aug 24, 2026 09:141,70151,043,344119,102,0001,006,0002,170,880stderr
8Aug 24, 2026 09:141,70651,181,963120,721,0001,020,0002,170,880stderr
9Aug 24, 2026 09:141,71951,576,456121,749,0001,017,0002,170,880stderr