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 listApr 14, 2025 17:54Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 17:5400000Error: expected "429496465080 ", got "377956922640 "stderr
2Apr 14, 2025 17:5458,53552,066,13421,658,00002,531,328
3Apr 14, 2025 17:5458,60045,045,27520,650,0001,032,0002,428,928
4Apr 14, 2025 17:5459,85145,282,71420,132,0002,013,0002,531,328