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 16, 2026 18:55Victor MerckléVictor MerckléScore: 22,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 18:5622,047192,841,411181,915,0001,078,0002,117,632stderr
2Sep 16, 2026 18:5622,057192,931,768182,028,0001,047,0002,117,632stderr
3Sep 16, 2026 18:5622,101193,327,782182,330,0001,111,0002,117,632stderr
4Sep 16, 2026 18:5622,161193,801,780182,883,0001,054,0002,117,632stderr
5Sep 16, 2026 18:5622,173193,872,640182,979,0001,065,0002,117,632stderr
6Sep 16, 2026 18:5622,184193,949,499183,050,0001,079,0002,117,632stderr
7Sep 16, 2026 18:5622,185195,031,159183,096,0001,040,0002,117,632stderr
8Sep 16, 2026 18:5622,212194,169,384183,311,0001,052,0002,117,632stderr
9Sep 16, 2026 18:5622,221194,229,743183,388,0001,053,0002,117,632stderr