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 listMar 3, 2026 12:52NoSIMD_C#NoSIMD_C#Score: 167,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 12:52167,02790,297,09459,807,0001,993,0002,539,520
2Mar 3, 2026 12:52167,64994,337,85759,029,0003,001,0002,306,048
3Mar 3, 2026 12:52167,71486,732,44459,052,0003,002,0002,551,808
4Mar 3, 2026 12:52167,80086,698,66060,084,0002,002,0002,539,520
5Mar 3, 2026 12:52167,88488,394,69659,112,0003,005,0002,551,808
6Mar 3, 2026 12:52168,45188,480,07859,312,0003,015,0002,543,616
7Mar 3, 2026 12:52168,54390,976,32859,344,0003,017,0002,306,048
8Mar 3, 2026 12:52168,72489,309,59560,415,0002,013,0002,543,616
9Mar 3, 2026 12:52168,75495,608,01659,418,0003,021,0002,531,328