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 listOct 16, 2026 22:21janwwwjanwwwScore: 61,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 22:2361,40231,587,31122,719,00002,113,536
2Oct 16, 2026 22:2361,46231,804,44022,741,00002,113,536
3Oct 16, 2026 22:2361,61331,713,45521,755,0001,042,0002,113,536
4Oct 16, 2026 22:2361,63531,734,99521,794,0001,011,0002,113,536
5Oct 16, 2026 22:2361,69431,518,18221,813,0001,014,0002,113,536
6Oct 16, 2026 22:2361,71831,741,00422,836,00002,113,536
7Oct 16, 2026 22:2361,77531,744,54321,815,0001,042,0002,113,536
8Oct 16, 2026 22:2362,00831,726,44022,943,00002,113,536
9Oct 16, 2026 22:2362,07231,776,45921,927,0001,040,0002,113,536