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 listMar 29, 2026 00:09Dominique GarmierDominique GarmierScore: 223,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 06:04223,289107,384,41781,610,0001,007,0002,535,424
2Mar 29, 2026 00:09223,314113,770,29981,619,0001,007,0002,334,720
3Mar 29, 2026 06:04223,770112,970,28679,803,0002,992,0002,326,528
4Mar 29, 2026 00:09223,786104,570,89480,806,0001,995,0002,535,424
5Mar 29, 2026 06:04223,803117,201,20779,814,0002,993,0002,334,720
6Mar 29, 2026 00:09223,830114,614,71379,824,0002,993,0002,543,616