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 01:50Victor MerckléVictor MerckléScore: 3,093Success
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 01:522,95288,564,591234,189,0002,041,0002,170,880stderr
2Aug 18, 2026 01:523,01090,305,229238,611,0001,017,0002,170,880stderr
3Aug 18, 2026 01:523,05291,579,334241,926,0001,017,0002,170,880stderr
4Aug 18, 2026 01:523,08192,431,664245,700,0002,029,0002,170,880stderr
5Aug 18, 2026 01:523,09392,798,755247,502,0002,195,0002,170,880stderr
6Aug 18, 2026 01:523,10193,059,107248,373,0001,010,0002,170,880stderr
7Aug 18, 2026 01:523,11693,487,465248,652,0001,004,0002,170,880stderr
8Aug 18, 2026 01:523,11893,551,737248,949,0002,300,0002,170,880stderr
9Aug 18, 2026 01:523,12893,848,518247,011,0002,006,0002,170,880stderr