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 listMay 4, 2026 05:52Josu San MartinJosu San MartinScore: 59,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 05:5359,08140,628,12320,787,0001,073,0002,387,968
2May 4, 2026 05:5359,11339,948,85620,795,0001,077,0002,383,872
3May 4, 2026 05:5359,21837,705,46520,835,0001,076,0002,375,680
4May 4, 2026 05:5359,29741,216,89920,859,0001,081,0002,387,968
5May 4, 2026 05:5359,30036,634,27720,872,0001,069,0002,383,872
6May 4, 2026 05:5359,32737,708,85220,894,0001,057,0002,379,776
7May 4, 2026 05:5359,41339,871,80220,907,0001,076,0002,383,872
8May 4, 2026 05:5359,45437,170,17720,941,0001,057,0002,375,680
9May 4, 2026 05:5359,48337,985,16320,932,0001,077,0002,383,872