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 19, 2025 07:55Ian MckibbenIan MckibbenScore: 71,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 07:5570,99747,462,57524,249,0002,020,0002,428,928
2Jan 19, 2025 07:5571,03248,386,13824,261,0002,021,0002,531,328
3Jan 19, 2025 07:5571,29548,599,80026,379,00002,510,848
4Jan 19, 2025 07:5571,45750,313,35126,439,00002,531,328
5Jan 19, 2025 07:5571,50848,423,66026,458,00002,531,328
6Jan 19, 2025 07:5571,60047,411,96625,474,0001,018,0002,531,328
7Jan 19, 2025 07:5571,75450,281,51426,549,00002,424,832
8Jan 19, 2025 07:5572,20552,991,97225,727,000989,0002,433,024
9Jan 19, 2025 07:5573,94151,095,97425,332,0002,026,0002,531,328