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 24, 2026 22:38Victor MerckléVictor MerckléScore: 75,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 22:3874,88637,194,65926,433,0001,275,0002,117,632stderr
2Jun 24, 2026 22:3874,96236,835,76926,476,0001,260,0002,117,632stderr
3Jun 24, 2026 22:3875,11036,865,66926,769,0001,022,0002,117,632stderr
4Jun 24, 2026 22:3875,15136,963,81726,532,0001,274,0002,117,632stderr
5Jun 24, 2026 22:3875,15138,056,17326,541,0001,265,0002,117,632stderr
6Jun 24, 2026 22:3875,37837,013,48026,670,0001,220,0002,117,632stderr
7Jun 24, 2026 22:3875,51037,075,10426,672,0001,267,0002,117,632stderr
8Jun 24, 2026 22:3875,60537,021,81826,949,0001,025,0002,117,632stderr
9Jun 24, 2026 22:3875,68637,082,24726,982,0001,022,0002,117,632stderr