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 8, 2021 12:08Yuriy LyfenkoYuriy LyfenkoScore: 207,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 12:08199,110626,837,84173,670,83402,224,128
2Jul 8, 2021 12:08207,663636,206,53576,835,44002,265,088
3Jul 8, 2021 12:08210,860635,526,37878,018,11002,256,896