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 listOct 14, 2024 17:55Joad NacerJoad NacerScore: 62,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 17:5561,81646,226,94221,878,000994,0002,433,024
2Oct 14, 2024 17:5561,82249,914,97520,885,0001,989,0002,428,928
3Oct 14, 2024 17:5561,96244,566,34320,933,0001,993,0002,428,928
4Oct 14, 2024 17:5561,98144,042,13821,936,000997,0002,273,280
5Oct 14, 2024 17:5562,00548,716,29720,947,0001,995,0002,428,928
6Oct 14, 2024 17:5562,12742,784,91521,988,000999,0002,514,944
7Oct 14, 2024 17:5562,13549,013,99120,991,0001,999,0002,424,832
8Oct 14, 2024 17:5562,13841,459,42621,992,000999,0002,433,024
9Oct 14, 2024 17:5562,21954,747,91621,020,0002,001,0002,433,024