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 19, 2026 03:00olliecrowolliecrowScore: 121,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 03:00121,15976,767,99542,837,0001,992,0002,273,280
2Apr 19, 2026 03:00121,19572,180,64943,846,000996,0002,289,664
3Apr 19, 2026 03:00122,50375,937,34143,312,0002,014,0002,277,376