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 15:55Victor MerckléVictor MerckléScore: 2,084Success
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 15:572,06061,829,134154,941,0001,144,0002,170,880stderr
2Aug 17, 2026 15:572,06661,985,509154,058,0001,218,0002,170,880stderr
3Aug 17, 2026 15:572,06962,091,711156,011,0001,145,0002,170,880stderr
4Aug 17, 2026 15:572,08062,414,831153,884,0001,216,0002,170,880stderr
5Aug 17, 2026 15:572,08462,536,305154,817,0001,224,0002,170,880stderr
6Aug 17, 2026 15:572,08462,547,244156,158,0001,240,0002,170,880stderr
7Aug 17, 2026 15:572,08562,566,343155,787,0001,207,0002,170,880stderr
8Aug 17, 2026 15:572,08562,576,000154,311,0001,210,0002,170,880stderr
9Aug 17, 2026 15:572,09162,740,534154,065,0001,224,0002,170,880stderr