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 16, 2026 08:33Victor MerckléVictor MerckléScore: 3,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 08:383,949118,488,766323,439,0001,015,0002,170,880stderr
2Aug 16, 2026 08:383,954118,647,776324,486,0001,208,0002,170,880stderr
3Aug 16, 2026 08:383,956118,693,751324,056,0002,305,0002,170,880stderr
4Aug 16, 2026 08:383,962118,872,449324,802,0002,023,0002,170,880stderr
5Aug 16, 2026 08:383,970119,116,279325,099,0002,015,0002,170,880stderr
6Aug 16, 2026 08:383,984119,527,201324,235,0002,013,0002,170,880stderr
7Aug 16, 2026 08:383,993119,818,536323,225,0001,037,0002,170,880stderr
8Aug 16, 2026 08:384,025120,750,105326,452,0001,033,0002,170,880stderr
9Aug 16, 2026 08:384,038121,150,895324,866,0001,030,0002,170,880stderr