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 listSep 20, 2025 11:42CemaCemaScore: 116,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 11:42116,44366,106,04442,083,0001,001,0002,265,088
2Sep 20, 2025 11:42116,57868,533,79541,128,0002,006,0002,523,136
3Sep 20, 2025 11:42117,60570,496,81442,503,0001,011,0002,265,088