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 15, 2026 23:33Victor MerckléVictor MerckléScore: 4,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 23:344,449133,478,724367,504,0003,170,0002,695,168stderr
2Aug 15, 2026 23:344,451133,547,133366,769,0003,135,0002,654,208stderr
3Aug 15, 2026 23:344,458133,751,754366,355,0003,163,0002,613,248stderr
4Aug 15, 2026 23:344,478134,345,549369,932,0003,153,0002,695,168stderr
5Aug 15, 2026 23:344,481134,451,918366,687,0003,158,0002,613,248stderr
6Aug 15, 2026 23:344,489134,678,575368,610,0003,160,0002,695,168stderr
7Aug 15, 2026 23:344,495134,876,885368,714,0003,119,0002,654,208stderr
8Aug 15, 2026 23:344,504135,146,242368,568,0003,169,0002,650,112stderr
9Aug 15, 2026 23:344,520135,607,627368,747,0003,121,0002,613,248stderr