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:23mebowlermebowlerScore: 300,397Success
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:23295,700138,915,53064,240,00045,169,0002,543,616
2Jan 28, 2025 08:23299,305136,232,29860,859,00049,884,0002,453,504
3Jan 28, 2025 08:23299,803139,278,73760,960,00049,967,0002,330,624
4Jan 28, 2025 08:23300,146138,884,13462,030,00049,024,0002,519,040
5Jan 28, 2025 08:23300,397137,114,16461,081,00050,066,0002,506,752
6Jan 28, 2025 08:23300,730134,975,23964,156,00047,114,0002,506,752
7Jan 28, 2025 08:23300,822135,123,67162,170,00049,134,0002,375,680
8Jan 28, 2025 08:23301,100134,819,80860,220,00051,187,0002,387,968
9Jan 28, 2025 08:23302,111140,065,74859,883,00051,898,0002,519,040