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 listSep 12, 2026 09:52Haha ExpertHaha ExpertScore: 67,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 09:5367,51833,616,98223,936,0001,046,0002,117,632
2Sep 12, 2026 09:5367,52934,348,70623,964,0001,022,0002,117,632
3Sep 12, 2026 09:5367,63533,668,83223,959,0001,066,0002,117,632
4Sep 12, 2026 09:5367,78933,647,06524,028,0001,054,0002,117,632
5Sep 12, 2026 09:5367,88133,813,83123,955,0001,161,0002,117,632
6Sep 12, 2026 09:5367,91633,769,00924,103,0001,026,0002,117,632
7Sep 12, 2026 09:5368,05433,795,39724,138,0001,042,0002,117,632
8Sep 12, 2026 09:5368,09435,116,64824,155,0001,040,0002,117,632
9Sep 12, 2026 09:5368,19433,809,91324,026,0001,206,0002,117,632