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 5, 2026 12:58wnwnScore: 4,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:004,14342,845,58233,352,0001,038,0002,113,536
2Sep 5, 2026 13:004,15142,983,13933,425,0001,031,0002,113,536
3Sep 5, 2026 13:004,15644,851,07933,462,0001,038,0002,113,536
4Sep 5, 2026 13:004,16243,051,13733,504,0001,043,0002,113,536
5Sep 5, 2026 13:004,16743,043,09633,587,0001,004,0002,113,536
6Sep 5, 2026 13:004,18743,229,05833,738,0001,020,0002,113,536
7Sep 5, 2026 13:004,20843,470,16933,912,0001,022,0002,113,536
8Sep 5, 2026 13:004,25843,827,91734,344,0001,002,0002,113,536
9Sep 5, 2026 13:004,30444,197,33734,645,0001,082,0002,113,536