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 listFeb 17, 2023 19:19LiamLiamError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2023 19:1900000Error: No answer to stdout. Died or killed?stderr
2Feb 17, 2023 19:19113,923104,714,87542,151,40902,256,896
3Feb 17, 2023 19:19114,130105,277,61842,228,17702,273,280
4Feb 17, 2023 19:19115,144127,378,40942,603,38602,265,088