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 19, 2026 02:31Charles CabergsCharles CabergsScore: 72,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 02:3172,06554,605,44325,639,0001,025,0002,371,584
2Apr 19, 2026 02:3172,07653,089,89825,643,0001,025,0002,383,872
3Apr 19, 2026 02:3172,08652,742,81725,647,0001,025,0002,375,680
4Apr 19, 2026 02:3172,10852,181,82525,654,0001,026,0002,359,296
5Apr 19, 2026 02:3172,58155,518,73625,861,000994,0002,371,584
6Apr 19, 2026 02:3172,58651,647,11124,868,0001,989,0002,367,488
7Apr 19, 2026 02:3172,62252,430,51823,885,0002,985,0002,502,656
8Apr 19, 2026 02:3172,72754,375,51024,916,0001,993,0002,363,392
9Apr 19, 2026 02:3172,73254,306,29024,918,0001,993,0002,510,848