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 listJan 13, 2026 01:21Josu San MartinJosu San MartinScore: 71,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 01:2171,01651,760,41825,266,0001,010,0002,314,240
2Jan 13, 2026 01:2171,24650,668,73825,348,0001,013,0002,289,664
3Jan 13, 2026 01:2171,51148,733,23125,442,0001,017,0002,289,664