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 10:41Victor MerckléVictor MerckléScore: 57,013Success
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 10:4256,82128,461,14621,024,00002,113,536
2Jun 25, 2026 10:4256,82428,463,30721,025,00002,113,536
3Jun 25, 2026 10:4256,84828,487,62621,034,00002,113,536
4Jun 25, 2026 10:4256,85129,116,03120,031,0001,004,0002,113,536
5Jun 25, 2026 10:4257,01328,548,26121,095,00002,113,536
6Jun 25, 2026 10:4257,04328,566,92120,077,0001,029,0002,113,536
7Jun 25, 2026 10:4257,11628,590,93320,115,0001,018,0002,113,536
8Jun 25, 2026 10:4257,17828,960,87220,140,0001,016,0002,113,536
9Jun 25, 2026 10:42144,36460,883,22753,415,00002,113,536