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:56mebowlermebowlerScore: 275,130Success
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:56272,738126,727,21763,945,00036,968,0002,293,760
2Jan 28, 2025 08:56273,419128,596,21458,095,00043,070,0002,326,528
3Jan 28, 2025 08:56273,422127,526,69753,087,00048,079,0002,306,048
4Jan 28, 2025 08:56274,389126,244,78364,332,00037,192,0002,445,312
5Jan 28, 2025 08:56275,130130,225,89359,881,00041,917,0002,326,528
6Jan 28, 2025 08:56275,157125,611,18756,893,00044,915,0002,445,312
7Jan 28, 2025 08:56275,178124,839,89558,894,00042,922,0002,326,528
8Jan 28, 2025 08:56275,403129,097,93166,934,00034,965,0002,326,528
9Jan 28, 2025 08:56277,249127,802,25256,320,00046,262,0002,449,408