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 listMar 15, 2026 18:43Elijah KinElijah KinScore: 733,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 18:43723,178293,913,31478,875,000188,701,0002,428,928
2Mar 15, 2026 18:43727,019292,248,17987,999,000180,998,0002,269,184
3Mar 15, 2026 18:43729,376293,181,82374,963,000194,906,0002,297,856
4Mar 15, 2026 18:43729,641295,025,32279,990,000189,977,0002,445,312
5Mar 15, 2026 18:43733,532297,783,40670,845,000200,562,0002,453,504
6Mar 15, 2026 18:43734,870293,668,20474,973,000196,929,0002,293,760
7Mar 15, 2026 18:43736,251297,574,96670,847,000201,566,0002,396,160
8Mar 15, 2026 18:43744,468299,480,08768,863,000206,590,0002,297,856
9Mar 15, 2026 18:43744,724307,012,92882,864,000192,684,0002,269,184