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 listApr 28, 2026 17:30Victor MerckléVictor MerckléScore: 6,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 17:316,472194,161,610462,958,00050,885,0002,772,992
2Apr 28, 2026 17:316,521195,657,920467,825,00048,981,0002,703,360
3Apr 28, 2026 17:316,545196,354,641466,510,00051,055,0002,523,136
4Apr 28, 2026 17:316,586197,580,415474,028,00039,918,0002,584,576
5Apr 28, 2026 17:316,608198,261,051458,027,00054,883,0002,576,384
6Apr 28, 2026 17:316,665199,979,754469,156,00043,014,0002,654,208
7Apr 28, 2026 17:316,669200,084,172471,222,00045,021,0002,580,480
8Apr 28, 2026 17:316,697200,924,321459,642,00055,956,0002,764,800
9Apr 28, 2026 17:316,726201,798,462470,999,00041,999,0002,555,904