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 listApr 22, 2026 16:57Charles CabergsCharles CabergsScore: 70,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 16:5870,67545,141,13425,145,0001,005,0002,363,392
2Apr 22, 2026 16:5870,69742,222,29024,146,0002,012,0002,351,104
3Apr 22, 2026 16:5870,83243,505,54724,192,0002,016,0002,359,296
4Apr 22, 2026 16:5870,84041,868,96024,195,0002,016,0002,363,392
5Apr 22, 2026 16:5870,86249,719,06524,203,0002,016,0002,306,048
6Apr 22, 2026 16:5870,87841,045,30924,208,0002,017,0002,355,200
7Apr 22, 2026 16:5870,94344,360,37224,230,0002,019,0002,355,200
8Apr 22, 2026 16:5871,00845,774,35425,263,0001,010,0002,310,144
9Apr 22, 2026 16:5871,06448,845,93825,283,0001,011,0002,371,584