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 3, 2026 13:22IlyaIlyaScore: 60,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 13:2360,33731,886,63521,215,0001,110,0002,113,536
2Jul 3, 2026 13:2360,40531,861,43921,245,0001,105,0002,113,536
3Jul 3, 2026 13:2360,43732,404,44121,256,0001,106,0002,113,536
4Jul 3, 2026 13:2360,54531,907,89821,286,0001,116,0002,113,536
5Jul 3, 2026 13:2360,69432,001,49521,337,0001,120,0002,113,536
6Jul 3, 2026 13:2360,81332,123,95921,383,0001,118,0002,113,536
7Jul 3, 2026 13:2360,90232,585,59221,309,0001,225,0002,113,536
8Jul 3, 2026 13:2360,97832,188,43321,530,0001,032,0002,113,536
9Jul 3, 2026 13:2361,00232,040,63621,453,0001,118,0002,113,536