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 listJun 21, 2026 22:43A_ShamanA_ShamanScore: 1,316,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 22:441,299,754490,270,729296,124,000184,785,0002,113,536
2Jun 21, 2026 22:441,303,086491,910,472298,435,000183,707,0002,117,632
3Jun 21, 2026 22:441,303,975492,064,381300,009,000182,462,0002,117,632
4Jun 21, 2026 22:441,315,091496,361,616301,175,000185,409,0002,117,632
5Jun 21, 2026 22:441,316,456496,550,368303,231,000183,858,0002,113,536
6Jun 21, 2026 22:441,319,391497,473,135303,120,000185,055,0002,113,536
7Jun 21, 2026 22:441,324,272499,850,971304,966,000185,015,0002,117,632
8Jun 21, 2026 22:441,324,300501,168,614304,309,000185,682,0002,113,536
9Jun 21, 2026 22:441,351,151509,252,221314,591,000185,335,0002,113,536