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 listJul 16, 2023 15:06Paul MasurelPaul MasurelScore: 73,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 15:0672,799122,741,59226,935,47502,314,240
2Jul 16, 2023 15:0673,02998,886,16127,020,63102,195,456
3Jul 16, 2023 15:0688,035103,205,39332,572,84602,191,360