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 listMay 27, 2024 00:00Joad NacerJoad NacerScore: 71,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2024 00:0071,91190,940,19626,607,15402,265,088
2May 27, 2024 00:0071,92884,811,65726,613,52402,265,088
3May 27, 2024 00:0072,342100,549,68726,766,72402,269,184