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 24, 2026 09:09Victor MerckléVictor MerckléScore: 1,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 09:101,68050,409,190119,350,0001,020,0002,170,880stderr
2Aug 24, 2026 09:101,68250,468,749119,505,0002,036,0002,170,880stderr
3Aug 24, 2026 09:101,68650,607,001118,397,0001,023,0002,170,880stderr
4Aug 24, 2026 09:101,68850,653,654119,548,0002,030,0002,170,880stderr
5Aug 24, 2026 09:101,69150,752,624118,966,0002,044,0002,170,880stderr
6Aug 24, 2026 09:101,69150,749,370119,028,0002,000,0002,170,880stderr
7Aug 24, 2026 09:101,69450,827,275119,936,0002,022,0002,170,880stderr
8Aug 24, 2026 09:101,69650,883,731118,717,0001,049,0002,170,880stderr
9Aug 24, 2026 09:101,71351,413,219118,633,0001,017,0002,170,880stderr