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 listApr 21, 2026 04:16Charles CabergsCharles CabergsScore: 71,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 04:1670,88151,675,38424,209,0002,017,0002,379,776
2Apr 21, 2026 04:1670,90855,382,29324,218,0002,018,0002,351,104
3Apr 21, 2026 04:1671,02953,686,71324,260,0002,021,0002,359,296
4Apr 21, 2026 04:1671,14550,575,90125,312,0001,012,0002,351,104
5Apr 21, 2026 04:1671,32450,675,14925,375,0001,015,0002,355,200
6Apr 21, 2026 04:1671,33549,657,18425,379,0001,015,0002,351,104
7Apr 21, 2026 04:1671,36251,652,89225,389,0001,015,0002,256,896
8Apr 21, 2026 04:1671,38654,538,73224,382,0002,031,0002,355,200
9Apr 21, 2026 04:1671,88643,285,08025,575,0001,023,0002,256,896