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 11, 2025 11:49Mikhail ShirokovMikhail ShirokovScore: 105,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 11:49105,12265,187,47937,898,000997,0002,523,136
2Jan 11, 2025 11:49105,18460,442,53637,921,000997,0002,523,136
3Jan 11, 2025 11:49105,31961,453,35637,969,000999,0002,445,312
4Jan 11, 2025 11:49105,63566,557,66138,083,0001,002,0002,523,136
5Jan 11, 2025 11:49105,64662,265,04638,087,0001,002,0002,527,232
6Jan 11, 2025 11:49105,91663,180,78438,185,0001,004,0002,523,136
7Jan 11, 2025 11:49106,28961,400,48339,327,00002,527,232
8Jan 11, 2025 11:49106,57664,674,58738,422,0001,011,0002,519,040
9Jan 11, 2025 11:49110,46266,283,35439,875,000996,0002,441,216