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 20:02Drew GarciaDrew GarciaScore: 79,157Success
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 20:0278,98454,943,71126,201,0003,023,0002,281,472
2Apr 18, 2025 20:0279,15751,930,60825,249,0004,039,0002,277,376
3Apr 18, 2025 20:0281,68957,233,51628,210,0002,015,0002,392,064