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 listFeb 16, 2025 19:10Ian MckibbenIan MckibbenScore: 29,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2025 19:1029,970279,514,248246,754,0001,998,0002,433,024
2Feb 16, 2025 19:1029,971269,505,853247,761,000999,0002,437,120
3Feb 16, 2025 19:1029,972281,545,548247,769,000999,0002,428,928
4Feb 16, 2025 19:1029,973281,214,617247,773,000999,0002,433,024
5Feb 16, 2025 19:1029,975275,210,620247,793,000999,0002,269,184
6Feb 16, 2025 19:1029,983272,343,551246,864,0001,998,0002,531,328
7Feb 16, 2025 19:1029,992275,887,071246,937,0001,999,0002,269,184
8Feb 16, 2025 19:1029,992272,608,386246,937,0001,999,0002,433,024
9Feb 16, 2025 19:1029,997267,343,585247,979,000999,0002,531,328