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 15, 2025 03:53Steve BronderSteve BronderScore: 63,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 03:5362,90048,603,31722,262,0001,011,0002,539,520
2Jul 15, 2025 03:5363,29246,066,86522,400,0001,018,0002,539,520
3Jul 15, 2025 03:5363,30045,289,06923,421,00002,428,928