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 18:26Genos0Genos0Score: 22,240,508Success
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 18:3122,141,9868,203,180,6288,041,416,000151,119,0002,113,536
2Jul 10, 2026 18:3122,240,5088,239,471,6298,079,074,000149,914,0002,113,536
3Jul 10, 2026 18:3122,445,3648,315,237,5548,155,752,000149,033,0002,113,536