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 listJan 17, 2026 01:48Josu San MartinJosu San MartinScore: 69,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 01:4869,24953,866,05525,622,00002,273,280
2Jan 17, 2026 01:4869,28152,622,71024,609,0001,025,0002,269,184
3Jan 17, 2026 01:4869,41456,755,54425,683,00002,482,176
4Jan 17, 2026 01:4869,45452,428,03025,698,00002,273,280
5Jan 17, 2026 01:4869,87853,122,78824,861,000994,0002,473,984
6Jan 17, 2026 01:4869,89258,959,83624,866,000994,0002,265,088