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 02:54olliecrowolliecrowScore: 218,873Success
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 02:54218,735103,209,74032,972,00047,960,0002,277,376
2Apr 19, 2026 02:54218,873102,430,85936,992,00043,991,0002,375,680
3Apr 19, 2026 02:54221,570109,291,30436,991,00044,990,0002,457,600