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 listSep 16, 2024 23:06CheranMahalingamCheranMahalingamScore: 738,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2024 23:06734,235304,682,90074,908,000196,759,0002,457,600
2Sep 16, 2024 23:06736,670299,578,35169,889,000202,679,0002,351,104
3Sep 16, 2024 23:06737,332302,506,14769,952,000202,861,0002,453,504
4Sep 16, 2024 23:06737,854301,435,00668,001,000205,005,0002,306,048
5Sep 16, 2024 23:06738,854301,961,44168,843,000204,533,0002,310,144
6Sep 16, 2024 23:06744,600303,963,59171,870,000203,632,0002,310,144
7Sep 16, 2024 23:06754,241304,348,80766,016,000213,053,0002,465,792
8Sep 16, 2024 23:06757,905306,365,62682,830,000197,595,0002,404,352
9Sep 16, 2024 23:06759,376303,893,58880,991,000199,978,0002,297,856