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 listMar 13, 2026 11:17Dominique GarmierDominique GarmierScore: 163,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 11:17162,61486,822,44858,162,0002,005,0002,273,280
2Mar 13, 2026 11:17163,28686,518,70860,416,00002,273,280
3Mar 13, 2026 11:17163,40581,532,26359,453,0001,007,0002,273,280
4Mar 13, 2026 11:17163,83289,243,81759,608,0001,010,0002,273,280
5Mar 13, 2026 11:17163,89592,629,96660,641,00002,277,376
6Mar 13, 2026 11:17163,91487,577,16460,648,00002,506,752
7Mar 13, 2026 11:17164,39790,632,18358,833,0001,994,0002,392,064
8Mar 13, 2026 11:17164,41493,419,61059,836,000997,0002,273,280
9Mar 13, 2026 11:17165,01187,699,84259,053,0002,001,0002,273,280