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 10, 2026 10:05Tomislav TunkovicTomislav TunkovicScore: 56,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 10:0656,78929,619,14721,012,000024,576stderr
2Sep 10, 2026 10:0656,81029,484,84221,020,000024,576stderr
3Sep 10, 2026 10:0656,86729,583,80821,041,000024,576stderr
4Sep 10, 2026 10:0656,88329,470,07321,047,000024,576stderr
5Sep 10, 2026 10:0656,89129,650,93721,050,000024,576stderr
6Sep 10, 2026 10:0657,00529,669,32321,092,000024,576stderr
7Sep 10, 2026 10:0657,01631,686,46421,096,000024,576stderr
8Sep 10, 2026 10:0657,06429,748,01721,114,000024,576stderr
9Sep 10, 2026 10:0657,22434,549,95921,173,000024,576stderr