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 22, 2025 05:10Ian MckibbenIan MckibbenScore: 69,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 05:1069,36251,993,89025,664,00002,269,184
2Jan 22, 2025 05:1069,86250,000,93225,849,00002,269,184
3Jan 22, 2025 05:1069,87656,661,67124,860,000994,0002,531,328
4Jan 22, 2025 05:1069,88452,541,28224,863,000994,0002,531,328
5Jan 22, 2025 05:1069,89252,554,20124,866,000994,0002,531,328
6Jan 22, 2025 05:1069,90053,199,81824,869,000994,0002,428,928
7Jan 22, 2025 05:1070,13047,795,56424,950,000998,0002,531,328
8Jan 22, 2025 05:1070,16550,633,51723,964,0001,997,0002,531,328
9Jan 22, 2025 05:1070,31950,138,93824,017,0002,001,0002,531,328