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 listFeb 21, 2024 16:03Huy Duc LeHuy Duc LeScore: 93,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 16:0392,84663,018,88433,343,0001,010,0002,281,472
2Feb 21, 2024 16:0392,97657,636,77831,366,0003,035,0002,277,376
3Feb 21, 2024 16:0393,20359,326,90033,471,0001,014,0002,531,328
4Feb 21, 2024 16:0393,22454,295,39332,464,0002,029,0002,379,776
5Feb 21, 2024 16:0393,43058,500,62734,569,00002,269,184
6Feb 21, 2024 16:0393,59761,311,34833,613,0001,018,0002,281,472
7Feb 21, 2024 16:0393,66562,847,87032,618,0002,038,0002,281,472
8Feb 21, 2024 16:0394,22767,548,52032,814,0002,050,0002,527,232
9Feb 21, 2024 16:0394,30064,642,26932,898,0001,993,0002,273,280
10Feb 21, 2024 16:0395,328101,452,06535,271,42602,273,280
11Feb 21, 2024 16:0397,329101,437,90936,011,79502,269,184
12Feb 21, 2024 16:0398,06797,881,61536,284,94602,265,088