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 15:02Sergey StreminSergey StreminScore: 168,249Success
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 15:01167,047133,993,31761,807,38402,260,992
2Jul 8, 2021 15:01167,747127,634,68962,066,45602,260,992
3Jul 8, 2021 15:02167,914117,776,18762,128,12702,211,840
4Jul 8, 2021 15:01168,249118,832,44962,252,30002,203,648
5Jul 8, 2021 15:02168,353136,614,74462,290,64402,256,896
6Jul 8, 2021 15:02169,493130,358,85562,712,40102,215,936