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 16:06Maxim ElchuginMaxim ElchuginScore: 441,047Success
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 16:06439,684224,774,095162,683,23602,269,184
2May 22, 2024 16:06441,047231,377,525163,187,39602,269,184
3May 22, 2024 16:06444,040223,644,759164,294,65302,179,072