Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listSep 12, 2026 15:54Kevin HeaveyKevin HeaveyScore: 3,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 15:553,56638,483,50928,353,0001,249,0002,113,536
2Sep 12, 2026 15:553,57340,154,64428,616,0001,043,0002,113,536
3Sep 12, 2026 15:553,60338,908,29428,683,0001,229,0002,113,536
4Sep 12, 2026 15:553,69639,551,15929,458,0001,222,0002,113,536
5Sep 12, 2026 15:553,78740,204,85630,399,0001,035,0002,113,536
6Sep 12, 2026 15:553,80340,287,57930,336,0001,231,0002,113,536
7Sep 12, 2026 15:553,81540,352,16230,639,0001,032,0002,113,536
8Sep 12, 2026 15:553,85440,749,20930,771,0001,225,0002,113,536
9Sep 12, 2026 15:553,88141,869,32731,134,0001,083,0002,113,536