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:57Haha ExpertHaha ExpertScore: 67,856Success
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:5867,51034,411,99723,955,0001,024,0002,117,632
2Sep 12, 2026 09:5867,51833,626,50023,955,0001,027,0002,117,632
3Sep 12, 2026 09:5867,58133,547,11423,953,0001,052,0002,117,632
4Sep 12, 2026 09:5867,74333,695,90724,018,0001,047,0002,117,632
5Sep 12, 2026 09:5867,85633,555,50224,042,0001,065,0002,117,632
6Sep 12, 2026 09:5867,93533,747,30724,079,0001,057,0002,117,632
7Sep 12, 2026 09:5867,94033,620,92624,082,0001,056,0002,117,632
8Sep 12, 2026 09:5868,10233,774,02224,153,0001,045,0002,117,632
9Sep 12, 2026 09:5868,36433,944,56024,200,0001,095,0002,117,632