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 15, 2026 20:33Elijah KinElijah KinScore: 203,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 20:33202,130101,158,25635,898,00038,890,0002,322,432
2Mar 15, 2026 20:33203,586101,735,33328,122,00047,205,0002,260,992
3Mar 15, 2026 20:33204,373103,727,61731,255,00044,363,0002,330,624