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 listDec 3, 2024 07:57A L ManningA L ManningScore: 28,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2024 07:5726,203786,104,3931,644,217,00024,988,0002,686,976
2Dec 3, 2024 07:5726,708801,246,9361,650,834,00028,997,0002,662,400
3Dec 3, 2024 07:5726,802804,053,3681,655,481,00022,978,0002,572,288
4Dec 3, 2024 07:5726,847805,417,0821,670,069,00025,969,0002,678,784
5Dec 3, 2024 07:5728,263847,878,4761,937,181,00022,990,0002,437,120
6Dec 3, 2024 07:5728,572857,164,4601,795,564,00024,020,0002,519,040
7Dec 3, 2024 07:5728,632858,958,5301,810,040,00025,986,0002,883,584
8Dec 3, 2024 07:5728,960868,789,0871,794,986,00033,980,0002,682,880
9Dec 3, 2024 07:5729,023870,684,7311,676,070,00017,990,0002,609,152