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 28, 2025 09:09mebowlermebowlerScore: 275,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 09:09273,278125,458,14450,056,00051,057,0002,297,856
2Jan 28, 2025 09:09273,624127,918,00951,122,00050,119,0002,293,760
3Jan 28, 2025 09:09274,073125,473,84563,254,00038,153,0002,400,256
4Jan 28, 2025 09:09274,843128,665,06161,813,00039,879,0002,297,856
5Jan 28, 2025 09:09275,157130,401,75865,876,00035,932,0002,297,856
6Jan 28, 2025 09:09275,332132,629,20356,929,00044,944,0002,297,856
7Jan 28, 2025 09:09276,449125,409,31155,154,00047,132,0002,404,352
8Jan 28, 2025 09:09276,654129,008,68158,206,00044,156,0002,293,760
9Jan 28, 2025 09:09277,300131,682,98659,348,00043,253,0002,297,856