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 listApr 28, 2024 13:01Joad NacerJoad NacerScore: 22,234,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2024 13:0122,174,7278,266,774,2488,204,648,86002,289,664
2Apr 28, 2024 13:0122,234,5868,292,586,2778,226,796,65602,293,760
3Apr 28, 2024 13:0122,267,5648,297,552,1328,238,998,60302,293,760