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 04:54Victor MerckléVictor MerckléScore: 3,041Success
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 04:553,03190,958,990237,803,0002,330,0002,170,880stderr
2Aug 16, 2026 04:553,03391,001,235237,459,0001,155,0002,170,880stderr
3Aug 16, 2026 04:553,03691,082,572241,859,0001,131,0002,170,880stderr
4Aug 16, 2026 04:553,04091,211,051240,342,0001,134,0002,170,880stderr
5Aug 16, 2026 04:553,04191,244,572239,514,0002,139,0002,170,880stderr
6Aug 16, 2026 04:553,04791,418,668238,965,0001,141,0002,170,880stderr
7Aug 16, 2026 04:553,04991,487,776241,536,0001,137,0002,170,880stderr
8Aug 16, 2026 04:553,06391,913,588242,323,0001,146,0002,170,880stderr
9Aug 16, 2026 04:553,07492,230,959242,898,0001,149,0002,170,880stderr