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 listAug 4, 2023 17:12gchebanovgchebanovScore: 74,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2023 17:1273,88281,312,13527,336,29602,232,320
2Aug 4, 2023 17:1274,029113,943,07527,390,66002,314,240
3Aug 4, 2023 17:1276,11190,533,92528,161,05702,244,608