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 00:37olliecrowolliecrowScore: 64,040Success
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 00:3963,67236,441,40722,535,0001,024,0002,281,472
2Apr 21, 2026 00:3963,82150,516,29223,614,00002,486,272
3Apr 21, 2026 00:3963,95454,808,02522,635,0001,028,0002,498,560
4Apr 21, 2026 00:3963,96749,548,03321,610,0002,058,0002,498,560
5Apr 21, 2026 00:3964,04050,749,56422,665,0001,030,0002,494,464
6Apr 21, 2026 00:3964,38352,125,53521,837,0001,985,0002,490,368
7Apr 21, 2026 00:3964,43751,499,87621,856,0001,986,0002,498,560
8Apr 21, 2026 00:3964,50040,548,78520,882,0002,983,0002,285,568
9Apr 21, 2026 00:3964,52948,526,63322,882,000994,0002,498,560