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 28, 2023 19:09Yurkov AlekseyYurkov AlekseyScore: 181,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2023 19:09180,862137,835,66366,918,91102,281,472
2Mar 28, 2023 19:09181,064146,912,88766,993,71002,273,280
3Mar 28, 2023 19:09181,387133,366,47867,113,19402,265,088