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 listJul 10, 2026 19:09Genos0Genos0Score: 329,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 19:10327,940131,233,96657,111,00064,227,0002,113,536
2Jul 10, 2026 19:10328,424131,590,15657,109,00064,408,0002,113,536
3Jul 10, 2026 19:10328,678131,371,68157,126,00064,485,0002,113,536
4Jul 10, 2026 19:10329,416132,105,00657,161,00064,723,0002,113,536
5Jul 10, 2026 19:10329,891131,785,46757,174,00064,886,0002,113,536
6Jul 10, 2026 19:10330,621132,101,89857,120,00065,210,0002,113,536
7Jul 10, 2026 19:10331,302133,751,89757,605,00064,977,0002,113,536
8Jul 10, 2026 19:10331,424132,406,77357,705,00064,922,0002,113,536
9Jul 10, 2026 19:10332,502133,251,33757,644,00065,382,0002,113,536