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 03:03Victor 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 17, 2026 03:1001,922,464,3005,721,231,0001,001,0002,170,880expected "1026023 ", got "1026020 "stderr
2Aug 17, 2026 03:1001,907,722,1775,689,092,0002,010,0002,170,880expected "1025302 ", got "1025296 "stderr
3Aug 17, 2026 03:1001,914,773,2355,710,893,0001,027,0002,170,880expected "1023337 ", got "1023335 "stderr