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 8, 2026 15:25Victor MerckléVictor MerckléScore: 7,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 15:296,91265,824,60156,298,0001,075,0002,117,632stderr
2Sep 8, 2026 15:296,92366,033,16757,462,000024,576stderr
3Sep 8, 2026 15:297,43670,869,48057,554,0004,169,00024,576stderr
4Sep 8, 2026 15:297,45970,406,85457,454,0004,458,00024,576stderr
5Sep 8, 2026 15:297,51071,545,70557,581,0004,758,00024,576stderr
6Sep 8, 2026 15:297,52071,588,45057,414,0005,007,0002,117,632stderr
7Sep 8, 2026 15:297,54871,812,43058,126,0004,526,0002,117,632stderr
8Sep 8, 2026 15:297,66972,855,00457,884,0005,776,0002,117,632stderr
9Sep 8, 2026 15:298,71982,312,91457,835,00014,535,0002,117,632stderr