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 13, 2026 16:05Yehor BondarYehor BondarError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 16:060158,427,98478,203,00069,851,0002,138,112expected "1025793 ", got "0 "
2Aug 13, 2026 16:060158,780,71879,634,00068,864,0002,146,304expected "1020557 ", got "0 "
3Aug 13, 2026 16:060158,135,18177,798,00069,995,0002,138,112expected "1025661 ", got "0 "