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 20, 2026 19:17olliecrowolliecrowScore: 101,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 19:19100,72463,915,46236,261,0001,007,0002,428,928
2Mar 20, 2026 19:19100,84959,294,98435,297,0002,017,0002,330,624
3Mar 20, 2026 19:18101,30864,376,47736,471,0001,013,0002,428,928
4Mar 20, 2026 19:19101,59563,622,82435,559,0002,031,0002,437,120
5Mar 20, 2026 19:19101,83862,478,19335,644,0002,036,0002,330,624
6Mar 20, 2026 19:17101,84665,588,67836,665,0001,018,0002,342,912
7Mar 20, 2026 19:18101,87667,946,29735,657,0002,037,0002,342,912
8Mar 20, 2026 19:19102,24968,785,46535,841,0001,991,0002,437,120
9Mar 20, 2026 19:19102,32268,376,09135,867,0001,992,0002,342,912
10Mar 20, 2026 19:17102,32762,897,72734,872,0002,989,0002,445,312
11Mar 20, 2026 19:18102,34963,840,09036,846,0001,023,0002,441,216
12Mar 20, 2026 19:17103,74964,440,60135,357,0003,030,0002,445,312