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:55CemaCemaScore: 122,024Success
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:55121,63067,071,03043,003,0002,000,0002,519,040
2Sep 20, 2025 11:55122,02468,676,97143,143,0002,006,0002,285,568
3Sep 20, 2025 11:55123,00566,238,46344,501,0001,011,0002,273,280