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 10, 2026 22:34Franek KortaFranek KortaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 22:36029,910,47420,723,0001,107,0002,113,536expected "429496450462 ", got "412316604288"
2May 10, 2026 22:3658,95129,345,45020,687,0001,125,0002,113,536
3May 10, 2026 22:3659,01031,887,27020,724,0001,110,0002,113,536
4May 10, 2026 22:3659,02429,184,67520,775,0001,064,0002,113,536
5May 10, 2026 22:3659,04029,088,32820,782,0001,063,0002,113,536
6May 10, 2026 22:3659,27829,224,19720,915,0001,018,0002,113,536
7May 10, 2026 22:3659,33530,122,34120,876,0001,078,0002,113,536
8May 10, 2026 22:3659,40529,278,10720,890,0001,090,0002,113,536
9May 10, 2026 22:3660,03740,474,86321,154,0001,060,0002,113,536