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 listAug 14, 2026 12:28marko1597marko1597Score: 152,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 12:29150,8981,262,319,2981,251,366,0001,092,0002,117,632stderr
2Aug 14, 2026 12:29150,9721,263,008,0411,251,997,0001,077,0002,117,632stderr
3Aug 14, 2026 12:29151,2191,264,973,9461,254,017,0001,102,0002,117,632stderr
4Aug 14, 2026 12:29151,7761,269,654,2131,258,576,0001,167,0002,117,632stderr
5Aug 14, 2026 12:29152,1931,273,082,1901,262,101,0001,106,0002,117,632stderr
6Aug 14, 2026 12:29152,2521,273,666,6301,262,582,0001,113,0002,117,632stderr
7Aug 14, 2026 12:29152,4941,275,502,9291,264,469,0001,237,0002,117,632stderr
8Aug 14, 2026 12:29152,5021,275,679,1611,264,688,0001,079,0002,117,632stderr
9Aug 14, 2026 12:29153,7391,294,978,9901,274,907,0001,129,0002,117,632stderr