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 08:44mebowlermebowlerScore: 277,119Success
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 08:44273,868124,241,54057,187,00044,144,0002,502,656
2Jan 28, 2025 08:44274,514127,162,95266,373,00035,197,0002,326,528
3Jan 28, 2025 08:44274,689128,143,23059,371,00042,264,0002,392,064
4Jan 28, 2025 08:44276,154126,555,73661,106,00041,071,0002,330,624
5Jan 28, 2025 08:44277,119129,949,38755,288,00047,246,0002,330,624
6Jan 28, 2025 08:44277,776136,926,04162,864,00039,913,0002,387,968
7Jan 28, 2025 08:44279,814124,051,78058,299,00045,232,0002,330,624
8Jan 28, 2025 08:44279,878131,404,61449,264,00054,291,0002,326,528
9Jan 28, 2025 08:44280,057133,137,44061,368,00042,253,0002,396,160