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:40Yurkov AlekseyYurkov AlekseyScore: 240,832Success
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:40240,210156,770,72588,877,58802,265,088
2Mar 27, 2023 21:40240,832144,015,68889,107,83002,260,992
3Mar 27, 2023 21:40242,710155,493,34489,802,57402,265,088