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 listApr 16, 2026 01:54olliecrowolliecrowScore: 60,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 01:5660,57644,090,42922,413,00002,281,472
2Apr 16, 2026 01:5460,61445,272,28121,408,0001,019,0002,281,472
3Apr 16, 2026 01:5660,68647,541,16521,434,0001,020,0002,281,472
4Apr 16, 2026 01:5460,85747,808,88521,494,0001,023,0002,400,256
5Apr 16, 2026 01:5660,90348,170,51622,534,00002,281,472
6Apr 16, 2026 01:5460,92450,884,45021,518,0001,024,0002,396,160