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 listJun 25, 2026 08:02Victor MerckléVictor MerckléScore: 93,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 08:0393,42942,208,52334,569,00002,117,632stderr
2Jun 25, 2026 08:0393,53242,695,97933,558,0001,049,0002,117,632stderr
3Jun 25, 2026 08:0393,53542,183,57833,563,0001,045,0002,117,632stderr
4Jun 25, 2026 08:0393,62442,258,63433,641,0001,000,0002,117,632stderr
5Jun 25, 2026 08:0393,65442,389,52933,645,0001,007,0002,117,632stderr
6Jun 25, 2026 08:0393,87542,432,00333,705,0001,029,0002,117,632stderr
7Jun 25, 2026 08:0393,90042,753,54233,692,0001,051,0002,117,632stderr
8Jun 25, 2026 08:03181,05175,154,53065,964,0001,025,0002,117,632stderr
9Jun 25, 2026 08:03182,44374,933,97566,431,0001,073,0002,117,632stderr