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 listJun 10, 2026 13:14Victor MerckléVictor MerckléScore: 65,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 13:1464,98131,632,94222,909,0001,134,0002,117,632stderr
2Jun 10, 2026 13:1465,00531,596,60522,933,0001,119,0002,117,632stderr
3Jun 10, 2026 13:1465,21832,042,49822,991,0001,140,0002,117,632stderr
4Jun 10, 2026 13:1465,35132,086,60223,041,0001,139,0002,117,632stderr
5Jun 10, 2026 13:1465,37831,747,54123,063,0001,127,0002,117,632stderr
6Jun 10, 2026 13:1465,41832,123,95223,053,0001,152,0002,117,632stderr
7Jun 10, 2026 13:1465,47832,148,83623,076,0001,151,0002,117,632stderr
8Jun 10, 2026 13:1465,51031,807,24323,085,0001,154,0002,117,632stderr
9Jun 10, 2026 13:1465,75431,871,94523,189,0001,140,0002,117,632stderr