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 listMay 22, 2024 15:11Maxim ElchuginMaxim ElchuginScore: 1,830,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 15:11953,034412,868,884352,622,48202,289,664
2May 22, 2024 15:111,830,968737,999,892677,458,19102,277,376
3May 22, 2024 15:112,526,092999,242,878934,654,11402,273,280