TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listDec 24, 2024 18:57IhebIhebScore: 10,796,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 18:5710,690,1843,989,551,1763,816,496,000138,872,0002,285,568
2Dec 24, 2024 18:5710,796,6704,028,922,4013,856,915,000137,853,0002,285,568
3Dec 24, 2024 18:5710,942,8814,080,813,2763,911,972,000136,894,0002,281,472