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 17, 2026 23:26Victor MerckléVictor MerckléScore: 2,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 23:311,99659,896,510148,177,0001,219,0002,170,880stderr
2Aug 17, 2026 23:312,00160,058,817150,437,0001,132,0002,170,880stderr
3Aug 17, 2026 23:312,01560,466,481149,949,0001,218,0002,170,880stderr
4Aug 17, 2026 23:312,02760,814,496152,195,0001,163,0002,170,880stderr
5Aug 17, 2026 23:312,06361,916,212153,134,0001,063,0002,170,880stderr
6Aug 17, 2026 23:312,06662,002,255153,381,0001,258,0002,170,880stderr
7Aug 17, 2026 23:312,42572,751,024162,042,0001,003,0002,170,880stderr
8Aug 17, 2026 23:312,43072,908,741160,194,0001,010,0002,170,880stderr
9Aug 17, 2026 23:312,55976,774,029171,735,0001,259,0002,170,880stderr