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:37mebowlermebowlerScore: 275,224Success
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:37272,462133,058,88654,897,00045,914,0002,334,720
2Jan 28, 2025 09:37273,297123,200,40854,064,00047,056,0002,334,720
3Jan 28, 2025 09:37274,041128,343,42554,211,00047,184,0002,334,720
4Jan 28, 2025 09:37274,111124,367,96559,246,00042,175,0002,494,464
5Jan 28, 2025 09:37275,224126,030,98451,915,00049,918,0002,334,720
6Jan 28, 2025 09:37275,605129,500,52561,984,00039,990,0002,502,656
7Jan 28, 2025 09:37276,454127,342,40559,167,00043,121,0002,498,560
8Jan 28, 2025 09:37277,481126,469,38064,419,00038,249,0002,334,720
9Jan 28, 2025 09:37277,916130,284,07652,912,00049,917,0002,334,720