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 listNov 22, 2024 18:30Dan StolyarovDan StolyarovScore: 356,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 22, 2024 18:30356,008159,550,45384,822,00046,901,0002,371,584
2Nov 22, 2024 18:30356,943164,690,41984,044,00048,025,0002,461,696
3Nov 22, 2024 18:30358,859156,168,29883,860,00048,918,0002,465,792