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 listSep 16, 2024 22:31CheranMahalingamCheranMahalingamScore: 761,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2024 22:31751,578300,486,25082,025,000196,059,0002,306,048
2Sep 16, 2024 22:31752,976304,408,76392,867,000185,734,0002,277,376
3Sep 16, 2024 22:31754,119304,939,03193,008,000186,016,0002,387,968
4Sep 16, 2024 22:31759,076304,799,45776,961,000203,897,0002,306,048
5Sep 16, 2024 22:31761,003311,547,59981,875,000199,696,0002,314,240
6Sep 16, 2024 22:31761,554304,543,50578,937,000202,838,0002,306,048
7Sep 16, 2024 22:31774,892312,270,25770,928,000215,782,0002,306,048
8Sep 16, 2024 22:31774,900312,861,36779,920,000206,793,0002,498,560
9Sep 16, 2024 22:31775,716313,908,55787,004,000200,011,0002,404,352