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 21, 2026 18:28M-RochatM-RochatScore: 62,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:2959,38332,836,69520,909,0001,063,0002,113,536
2May 21, 2026 18:2959,68932,686,61220,941,0001,144,0002,113,536
3May 21, 2026 18:2959,87833,176,97421,005,0001,150,0002,113,536
4May 21, 2026 18:2959,88333,877,36421,066,0001,091,0002,113,536
5May 21, 2026 18:2962,01335,160,06121,790,0001,155,0002,113,536
6May 21, 2026 18:2962,09435,433,83521,823,0001,152,0002,113,536
7May 21, 2026 18:2962,24835,082,07721,881,0001,151,0002,113,536
8May 21, 2026 18:2962,27833,916,83621,886,0001,157,0002,113,536
9May 21, 2026 18:2962,34833,438,85821,926,0001,143,0002,113,536