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 27, 2024 10:58Xushi8Xushi8Score: 1,534,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2024 10:58993,562397,944,350165,828,000201,790,0002,359,296
2Oct 27, 2024 10:581,218,200478,748,839246,854,000203,880,0002,306,048
3Oct 27, 2024 10:581,466,954564,619,008334,860,000207,913,0002,502,656
4Oct 27, 2024 10:581,506,762579,502,686359,679,000197,823,0002,449,408
5Oct 27, 2024 10:581,534,746589,477,065381,903,000185,953,0002,314,240
6Oct 27, 2024 10:581,552,903596,366,061373,723,000200,851,0002,404,352
7Oct 27, 2024 10:581,824,900700,092,505476,445,000198,768,0002,281,472
8Oct 27, 2024 10:582,068,086787,636,122580,387,000184,805,0002,330,624
9Oct 27, 2024 10:582,070,754799,202,490571,388,000194,791,0002,306,048