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 19:09emily graceemily graceScore: 72,032Success
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 19:0971,72752,116,96825,519,0001,020,0002,289,664
2Apr 18, 2025 19:0972,03254,712,56325,627,0001,025,0002,277,376
3Apr 18, 2025 19:0972,08452,859,61825,646,0001,025,0002,289,664