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 listJul 14, 2021 13:47Yuriy LyfenkoYuriy LyfenkoScore: 88,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 13:4787,314555,217,22131,297,0001,009,0002,326,528
2Jul 14, 2021 13:4787,773552,864,06130,447,0002,029,0002,326,528
3Jul 14, 2021 13:4787,908563,684,50131,510,0001,016,0002,326,528
4Jul 14, 2021 13:4788,081561,336,07231,572,0001,018,0002,506,752
5Jul 14, 2021 13:4788,149557,966,36930,577,0002,038,0002,326,528
6Jul 14, 2021 13:4788,435559,066,98429,747,0002,974,0002,330,624
7Jul 14, 2021 13:4788,551561,886,17930,779,0001,985,0002,330,624
8Jul 14, 2021 13:4788,805593,782,94332,857,87002,248,704
9Jul 14, 2021 13:4789,165560,635,31330,992,0001,999,0002,506,752
10Jul 14, 2021 13:4789,166602,377,76632,991,58202,301,952
11Jul 14, 2021 13:4789,170588,241,14332,993,01402,179,072
12Jul 14, 2021 13:4789,192559,191,75830,001,0003,000,0002,514,944