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 2, 2026 15:09IlyaIlyaScore: 62,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 15:1162,54032,556,22022,055,0001,085,0002,113,536
2Jul 2, 2026 15:1162,67832,731,81822,058,0001,133,0002,113,536
3Jul 2, 2026 15:1162,72432,733,03222,000,0001,208,0002,113,536
4Jul 2, 2026 15:1162,79433,178,81922,034,0001,200,0002,113,536
5Jul 2, 2026 15:1162,84533,175,30622,061,0001,192,0002,113,536
6Jul 2, 2026 15:1162,86432,899,92422,035,0001,225,0002,113,536
7Jul 2, 2026 15:1162,99132,791,84822,185,0001,122,0002,113,536
8Jul 2, 2026 15:1163,01632,763,83722,110,0001,206,0002,113,536
9Jul 2, 2026 15:1163,07233,326,01722,123,0001,214,0002,113,536