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:53Elijah KinElijah KinScore: 729,784Success
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:53724,676295,337,10273,035,000195,095,0002,306,048
2Mar 15, 2026 18:53725,286294,410,77377,813,000190,543,0002,297,856
3Mar 15, 2026 18:53725,768303,523,13886,849,000181,685,0002,289,664
4Mar 15, 2026 18:53728,181299,487,84672,845,000196,582,0002,301,952
5Mar 15, 2026 18:53729,784294,855,98983,006,000187,014,0002,285,568
6Mar 15, 2026 18:53740,376300,536,37677,982,000195,957,0002,310,144
7Mar 15, 2026 18:53746,024301,975,06181,008,000195,021,0002,289,664
8Mar 15, 2026 18:53746,254302,137,91573,030,000203,084,0002,469,888
9Mar 15, 2026 18:53747,103305,200,05482,828,000193,600,0002,404,352