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 00:08Josu San MartinJosu San MartinScore: 70,219Success
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 00:0869,97650,408,19824,896,000995,0002,367,488
2Jan 13, 2026 00:0869,97653,320,71924,896,000995,0002,375,680
3Jan 13, 2026 00:0870,01156,406,14123,912,0001,992,0002,367,488
4Jan 13, 2026 00:0870,02745,172,12924,914,000996,0002,289,664
5Jan 13, 2026 00:0870,21956,568,23524,982,000999,0002,289,664
6Jan 13, 2026 00:0870,26550,805,16324,999,000999,0002,289,664
7Jan 13, 2026 00:0870,30851,698,05925,014,0001,000,0002,379,776
8Jan 13, 2026 00:0870,31154,184,95724,014,0002,001,0002,367,488
9Jan 13, 2026 00:0870,35953,542,10025,032,0001,001,0002,363,392