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 12, 2026 04:16Josu San MartinJosu San MartinScore: 86,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 04:1685,65460,785,06130,670,0001,022,0002,289,664
2Jan 12, 2026 04:1686,33862,986,16728,951,0002,994,0002,289,664
3Jan 12, 2026 04:1686,37065,501,21328,961,0002,996,0002,289,664