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 7, 2024 19:10Joad NacerJoad NacerScore: 78,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 19:1078,528108,346,25629,055,19802,269,184
2May 7, 2024 19:1078,949105,269,81529,211,30202,260,992
3May 7, 2024 19:1079,155101,242,45229,287,36902,281,472