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 listSep 10, 2026 14:25Tomislav TunkovicTomislav TunkovicScore: 2,321,572Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 14:272,316,924868,261,090790,597,00066,665,0002,117,632stderr
2Sep 10, 2026 14:272,317,043868,344,803790,317,00066,989,0002,117,632stderr
3Sep 10, 2026 14:272,317,527868,601,248790,803,00066,682,0002,117,632stderr
4Sep 10, 2026 14:272,320,975869,786,051790,830,00067,931,0002,117,632stderr
5Sep 10, 2026 14:272,321,572869,992,849790,907,00068,075,0002,117,632stderr
6Sep 10, 2026 14:272,323,340870,623,937791,330,00068,306,0002,117,632stderr
7Sep 10, 2026 14:272,326,418871,776,111792,668,00068,107,0002,117,632stderr
8Sep 10, 2026 14:272,328,518872,465,101790,694,00070,858,0002,117,632stderr
9Sep 10, 2026 14:272,328,843871,827,739790,567,00071,105,0002,117,632stderr