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 24, 2026 18:34Dominique GarmierDominique GarmierScore: 725,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 18:34715,692291,685,170263,807,000999,0002,543,616
2Mar 24, 2026 18:34725,111295,675,896267,290,0001,001,0002,334,720
3Mar 24, 2026 18:34732,070294,128,621268,867,0001,999,0002,326,528