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 listMar 27, 2023 21:43Yurkov AlekseyYurkov AlekseyScore: 249,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2023 21:43232,890159,516,50086,169,21302,260,992
2Mar 27, 2023 21:43249,569156,493,92092,340,60902,260,992
3Mar 27, 2023 21:43254,702167,761,61694,239,63102,273,280