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 20, 2026 14:39Andrew EpsteinAndrew EpsteinScore: 910,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 14:40907,229345,971,712334,418,0001,257,0002,117,632stderr
2Sep 20, 2026 14:40908,062347,704,859334,741,0001,242,0002,117,632stderr
3Sep 20, 2026 14:40908,264346,412,530335,054,0001,004,0002,117,632stderr
4Sep 20, 2026 14:40908,689346,517,029335,001,0001,214,0002,117,632stderr
5Sep 20, 2026 14:40910,872347,283,270335,769,0001,254,0002,117,632stderr
6Sep 20, 2026 14:40911,035348,076,547336,080,0001,003,0002,117,632stderr
7Sep 20, 2026 14:40911,886347,688,818336,248,0001,150,0002,117,632stderr
8Sep 20, 2026 14:40912,389347,739,067336,447,0001,137,0002,117,632stderr
9Sep 20, 2026 14:40912,527347,950,915336,481,0001,154,0002,117,632stderr