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 listApr 9, 2025 00:31NoSIMD_C#NoSIMD_C#Score: 272,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 00:31270,519127,203,76665,060,00035,032,0002,478,080
2Apr 9, 2025 00:31270,751128,257,20555,098,00045,080,0002,461,696
3Apr 9, 2025 00:31272,397127,216,44452,888,00047,899,0002,469,888
4Apr 9, 2025 00:31272,441134,232,35757,887,00042,916,0002,469,888
5Apr 9, 2025 00:31272,800129,304,43454,965,00045,971,0002,535,424
6Apr 9, 2025 00:31273,492130,593,48253,101,00048,091,0002,527,232
7Apr 9, 2025 00:31273,832129,784,26368,214,00033,104,0002,473,984
8Apr 9, 2025 00:31276,551126,155,73857,181,00045,143,0002,310,144
9Apr 9, 2025 00:31278,095131,109,90062,936,00039,959,0002,297,856