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 27, 2026 12:11Victor MerckléVictor MerckléScore: 4,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 12:124,38844,782,69535,356,0001,066,0002,117,632stderr
2Aug 27, 2026 12:124,42345,022,67735,555,0001,156,0002,117,632stderr
3Aug 27, 2026 12:124,43545,069,32635,657,0001,154,0002,117,632stderr
4Aug 27, 2026 12:124,44245,964,61435,654,0001,216,0002,117,632stderr
5Aug 27, 2026 12:124,44746,612,57635,784,0001,133,0002,117,632stderr
6Aug 27, 2026 12:124,45545,269,26835,866,0001,116,0002,117,632stderr
7Aug 27, 2026 12:124,46645,301,40835,986,0001,083,0002,117,632stderr
8Aug 27, 2026 12:124,56146,174,72336,805,0001,059,0002,117,632stderr
9Aug 27, 2026 12:124,66647,678,15237,651,0001,081,0002,117,632stderr