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 listJan 23, 2025 08:36NoSIMD_C#NoSIMD_C#Score: 272,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 08:36270,535127,182,49453,052,00047,046,0002,535,424
2Jan 23, 2025 08:36271,141131,051,50946,148,00054,174,0002,293,760
3Jan 23, 2025 08:36272,516129,414,13456,905,00043,926,0002,453,504
4Jan 23, 2025 08:36272,527127,292,05056,907,00043,928,0002,293,760
5Jan 23, 2025 08:36272,554126,487,82370,891,00029,954,0002,293,760
6Jan 23, 2025 08:36272,611128,375,41861,918,00038,948,0002,473,984
7Jan 23, 2025 08:36273,227130,027,66263,059,00038,035,0002,527,232
8Jan 23, 2025 08:36274,100125,822,71759,244,00042,173,0002,469,888
9Jan 23, 2025 08:36277,900130,129,95353,907,00048,916,0002,469,888