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 17:41NoSIMD_C#NoSIMD_C#Score: 273,030Success
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 17:41270,292129,580,06363,005,00037,003,0002,297,856
2Apr 9, 2025 17:41270,503135,154,61166,057,00034,029,0002,535,424
3Apr 9, 2025 17:41272,008133,929,10758,373,00042,270,0002,293,760
4Apr 9, 2025 17:41272,605123,370,34860,918,00039,946,0002,453,504
5Apr 9, 2025 17:41273,030129,581,49960,013,00041,008,0002,527,232
6Apr 9, 2025 17:41273,262127,370,33560,064,00041,043,0002,293,760
7Apr 9, 2025 17:41273,486126,318,51370,132,00031,058,0002,293,760
8Apr 9, 2025 17:41275,873127,052,44066,047,00036,026,0002,293,760
9Apr 9, 2025 17:41277,324129,048,06955,329,00047,281,0002,543,616