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 5, 2026 00:17olliecrowolliecrowScore: 69,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 04:0869,29249,978,67924,613,0001,025,0002,277,376
2Mar 4, 2026 04:0869,40358,698,02324,652,0001,027,0002,277,376
3Mar 4, 2026 04:0869,44651,421,24225,695,00002,277,376
4Mar 4, 2026 04:0869,85451,731,26624,852,000994,0002,277,376
5Mar 4, 2026 04:0869,85752,890,86825,847,00002,277,376
6Mar 4, 2026 04:0869,86551,228,67424,856,000994,0002,404,352
7Mar 4, 2026 04:0869,86556,455,06724,856,000994,0002,277,376
8Mar 4, 2026 04:0869,99555,224,39724,902,000996,0002,277,376
9Mar 4, 2026 04:0870,02752,868,68924,914,000996,0002,277,376
10Mar 5, 2026 00:1770,03551,573,49324,917,000996,0002,281,472
11Mar 5, 2026 00:1770,11955,838,83123,949,0001,995,0002,392,064
12Mar 5, 2026 00:1770,19554,958,72524,974,000998,0002,281,472