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 listMar 30, 2024 10:20woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 577,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2024 10:20574,961272,146,267212,735,63102,289,664
2Mar 30, 2024 10:20577,703288,958,151213,749,97002,281,472
3Mar 30, 2024 10:20578,627274,050,913214,091,95202,289,664