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 31, 2026 14:23Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 14:2301,367,708,9071,344,614,00012,598,0002,125,824expected "1024904 ", got "0 "stderr
2Aug 31, 2026 14:2301,367,803,5571,344,718,00012,591,0002,125,824expected "1025194 ", got "0 "stderr
3Aug 31, 2026 14:2301,369,537,1511,345,331,00013,637,0002,125,824expected "1020757 ", got "0 "stderr