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 23, 2026 18:40Victor 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 23, 2026 18:41056,208,705137,284,0002,019,0002,170,880expected "1022199 ", got "1022198 "stderr
2Aug 23, 2026 18:411,79353,802,519130,194,0001,015,0002,170,880stderr
3Aug 23, 2026 18:411,80454,136,838131,315,0001,011,0002,170,880stderr
4Aug 23, 2026 18:411,82454,727,124133,542,0001,274,0002,170,880stderr
5Aug 23, 2026 18:411,82654,804,083132,764,0001,085,0002,170,880stderr
6Aug 23, 2026 18:411,84155,237,577135,901,0001,271,0002,170,880stderr
7Aug 23, 2026 18:411,85655,703,797135,895,0001,279,0002,170,880stderr
8Aug 23, 2026 18:411,86856,067,402135,139,0001,010,0002,170,880stderr
9Aug 23, 2026 18:411,88256,460,229133,386,0001,241,0002,170,880stderr