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 18:31olliecrowolliecrowScore: 102,168Success
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 18:27100,54663,845,11335,192,0002,010,0002,555,904
2Mar 20, 2026 18:27100,72257,502,26535,253,0002,014,0002,342,912
3Mar 20, 2026 18:31101,31962,075,41435,462,0002,026,0002,326,528
4Mar 20, 2026 18:27101,45459,082,19435,509,0002,029,0002,342,912
5Mar 20, 2026 18:30101,84163,593,22036,663,0001,018,0002,441,216
6Mar 20, 2026 18:27101,85764,988,06335,704,0001,983,0002,342,912
7Mar 20, 2026 18:30102,16865,385,05135,759,0002,043,0002,605,056
8Mar 20, 2026 18:27102,32267,747,62935,867,0001,992,0002,342,912
9Mar 20, 2026 18:31102,37659,608,05935,886,0001,993,0002,342,912
10Mar 20, 2026 18:31102,71168,952,61635,003,0003,000,0002,441,216
11Mar 20, 2026 18:27102,80065,570,43036,035,0002,001,0002,342,912
12Mar 20, 2026 18:30102,88467,467,68835,062,0003,005,0002,342,912