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 listMay 22, 2024 04:44CemaCemaScore: 1,785,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 04:441,132,148486,889,006418,894,71402,273,280
2May 22, 2024 04:441,785,286735,105,770660,555,92602,277,376
3May 22, 2024 04:442,371,060941,730,132877,292,37102,269,184