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 26, 2026 12:32Victor MerckléVictor MerckléScore: 21,891,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 12:3421,469,6437,953,099,3127,929,533,00014,235,0002,117,632stderr
2Jun 26, 2026 12:3421,530,1677,974,403,4487,951,750,00014,412,0002,117,632stderr
3Jun 26, 2026 12:3421,598,9487,999,315,3767,977,732,00013,879,0002,117,632stderr
4Jun 26, 2026 12:3421,778,0678,065,942,6288,043,784,00014,101,0002,117,632stderr
5Jun 26, 2026 12:3421,891,5648,108,096,2178,086,337,00013,542,0002,117,632stderr
6Jun 26, 2026 12:3421,893,7548,108,597,9788,087,091,00013,598,0002,117,632stderr
7Jun 26, 2026 12:3422,016,5088,153,991,4978,132,364,00013,744,0002,117,632stderr
8Jun 26, 2026 12:3422,021,1758,155,706,0088,134,076,00013,759,0002,117,632stderr
9Jun 26, 2026 12:3422,048,0408,165,629,4508,143,908,00013,867,0002,117,632stderr