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 16, 2025 01:10emily graceemily graceScore: 233,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2025 01:10233,795112,591,28585,499,0001,005,0002,277,376
2Apr 16, 2025 01:10233,895112,181,69885,535,0001,006,0002,269,184
3Apr 16, 2025 01:10233,905114,098,07186,545,00002,289,664