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 03:29Josu San MartinJosu San MartinScore: 4,748Success
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 03:314,700141,025,029198,928,0002,118,0002,142,208
2Aug 18, 2026 03:314,734142,041,278199,263,0002,114,0002,142,208
3Aug 18, 2026 03:314,738142,167,139199,814,0002,119,0002,142,208
4Aug 18, 2026 03:314,747142,422,234199,639,0002,097,0002,142,208
5Aug 18, 2026 03:314,748142,459,622199,662,0002,109,0002,142,208
6Aug 18, 2026 03:314,752142,586,500200,399,0002,095,0002,142,208
7Aug 18, 2026 03:314,772143,173,333200,757,0002,091,0002,142,208
8Aug 18, 2026 03:314,792143,772,614199,962,0002,098,0002,142,208
9Aug 18, 2026 03:314,972149,170,426199,330,0002,192,0002,142,208