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 6, 2026 09:07Kevin HeaveyKevin HeaveyScore: 3,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 09:103,52737,651,77828,083,0001,198,0002,113,536
2Sep 6, 2026 09:103,54637,704,82028,238,0001,194,0002,113,536
3Sep 6, 2026 09:103,54637,769,21828,229,0001,209,0002,113,536
4Sep 6, 2026 09:103,55237,746,77028,427,0001,058,0002,113,536
5Sep 6, 2026 09:103,55837,883,40928,344,0001,193,0002,113,536
6Sep 6, 2026 09:103,56237,848,18428,529,0001,042,0002,113,536
7Sep 6, 2026 09:103,71439,231,60929,624,0001,204,0002,113,536
8Sep 6, 2026 09:103,78139,707,75930,195,0001,193,0002,113,536
9Sep 6, 2026 09:103,86340,362,04330,941,0001,128,0002,113,536