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:43Josu San MartinJosu San MartinScore: 68,943Success
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:4368,85451,335,30724,457,0001,019,0002,408,448
2Jan 13, 2026 02:4368,94346,759,23525,509,00002,404,352
3Jan 13, 2026 02:4369,27055,886,01724,605,0001,025,0002,277,376