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 listMay 12, 2026 00:41Victor MerckléVictor MerckléScore: 64,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:4264,44532,583,21122,838,0001,007,0002,113,536
2May 12, 2026 00:4264,48934,197,72922,851,0001,010,0002,113,536
3May 12, 2026 00:4264,54835,642,31422,799,0001,084,0002,113,536
4May 12, 2026 00:4264,57034,743,65222,870,0001,021,0002,113,536
5May 12, 2026 00:4264,59733,538,36322,804,0001,097,0002,113,536
6May 12, 2026 00:4264,65133,099,85122,824,0001,097,0002,113,536
7May 12, 2026 00:4264,85434,465,02122,986,0001,010,0002,113,536
8May 12, 2026 00:4264,86232,712,39022,981,0001,018,0002,113,536
9May 12, 2026 00:4265,03232,868,56822,977,0001,085,0002,113,536