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 5, 2025 19:17NoSIMD_C#NoSIMD_C#Score: 273,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 5, 2025 19:17270,832127,386,86473,152,00027,056,0002,310,144
2Apr 5, 2025 19:17270,876128,619,63582,184,00018,040,0002,539,520
3Apr 5, 2025 19:17272,449132,021,35955,443,00045,363,0002,539,520
4Apr 5, 2025 19:17272,641130,049,65458,928,00041,949,0002,293,760
5Apr 5, 2025 19:17273,041131,565,71964,016,00037,009,0002,293,760
6Apr 5, 2025 19:17273,100126,400,86258,027,00043,020,0002,293,760
7Apr 5, 2025 19:17274,011134,582,70662,236,00039,148,0002,486,272
8Apr 5, 2025 19:17275,305126,483,13252,929,00048,934,0002,469,888
9Apr 5, 2025 19:17275,481130,480,83061,956,00039,972,0002,473,984