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 listJan 29, 2024 12:54AnSaAnSaScore: 151,315Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 12:54151,084124,421,17155,900,96102,252,800
2Jan 29, 2024 12:54151,315124,298,50255,986,51202,240,512
3Jan 29, 2024 12:54151,587127,720,27256,087,31702,269,184