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 18, 2025 19:04emily graceemily graceScore: 71,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 19:0471,71449,279,86425,514,0001,020,0002,289,664
2Apr 18, 2025 19:0471,75452,400,47326,549,00002,269,184
3Apr 18, 2025 19:0471,78152,381,19625,538,0001,021,0002,289,664
4Apr 18, 2025 19:0471,90552,625,72025,582,0001,023,0002,289,664
5Apr 18, 2025 19:0471,92254,780,23925,588,0001,023,0002,289,664
6Apr 18, 2025 19:0472,01955,215,50025,623,0001,024,0002,281,472
7Apr 18, 2025 19:0472,06552,271,32126,664,00002,289,664
8Apr 18, 2025 19:0472,54955,934,42125,849,000994,0002,289,664
9Apr 18, 2025 19:0472,58954,977,53525,864,000994,0002,269,184