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 21, 2026 15:54Josu San MartinJosu San MartinScore: 61,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 15:5459,77649,901,07920,107,0002,010,0002,277,376
2Mar 21, 2026 15:5461,08448,289,80221,574,0001,027,0002,445,312
3Mar 21, 2026 15:5461,17349,684,40021,606,0001,028,0002,539,520