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:29mebowlermebowlerScore: 274,657Success
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:29273,224124,489,33450,046,00051,047,0002,392,064
2Jan 28, 2025 09:29273,238122,377,01964,062,00037,036,0002,293,760
3Jan 28, 2025 09:29273,351127,859,75057,079,00044,061,0002,293,760
4Jan 28, 2025 09:29274,389127,967,95553,275,00048,249,0002,400,256
5Jan 28, 2025 09:29274,657129,574,27259,778,00041,845,0002,400,256
6Jan 28, 2025 09:29275,468131,731,76957,956,00043,967,0002,297,856
7Jan 28, 2025 09:29275,738134,033,94061,014,00041,009,0002,293,760
8Jan 28, 2025 09:29276,151132,744,97963,109,00039,067,0002,297,856
9Jan 28, 2025 09:29276,695123,976,17956,207,00046,170,0002,293,760