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 02:55Josu San MartinJosu San MartinScore: 79,665Success
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 02:5579,37057,730,06128,355,0001,012,0002,404,352
2Jan 13, 2026 02:5579,66552,358,23229,476,00002,269,184
3Jan 13, 2026 02:5580,64354,795,92627,849,0001,989,0002,396,160