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 listJun 26, 2026 06:43IlyaIlyaScore: 21,549,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 06:4521,474,1217,955,391,7937,777,680,000167,745,0002,113,536
2Jun 26, 2026 06:4521,517,2837,970,902,1687,792,732,000168,663,0002,113,536
3Jun 26, 2026 06:4521,533,3867,977,332,3267,800,042,000167,311,0002,113,536
4Jun 26, 2026 06:4521,535,4187,978,397,5637,798,017,000170,088,0002,113,536
5Jun 26, 2026 06:4521,549,2787,982,688,8717,806,056,000167,177,0002,113,536
6Jun 26, 2026 06:4521,552,2817,984,539,7767,806,206,000168,138,0002,113,536
7Jun 26, 2026 06:4521,582,0247,995,337,6837,817,435,000167,914,0002,113,536
8Jun 26, 2026 06:4521,587,1167,996,722,9767,817,569,000169,664,0002,113,536
9Jun 26, 2026 06:4521,658,8708,023,156,1327,845,995,000167,787,0002,113,536