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 00:31Victor MerckléVictor MerckléScore: 5,342Success
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 00:325,30352,306,60439,802,0004,218,0002,117,632stderr
2Aug 27, 2026 00:325,30852,466,82939,806,0004,258,0002,117,632stderr
3Aug 27, 2026 00:325,31252,470,54839,810,0004,286,0002,117,632stderr
4Aug 27, 2026 00:325,32652,526,05840,016,0004,196,0002,117,632stderr
5Aug 27, 2026 00:325,34253,312,71740,075,0004,264,0002,117,632stderr
6Aug 27, 2026 00:325,34554,286,03040,273,0004,096,0002,117,632stderr
7Aug 27, 2026 00:325,34953,375,24740,134,0004,270,0002,117,632stderr
8Aug 27, 2026 00:325,35253,424,20740,166,0004,262,0002,117,632stderr
9Aug 27, 2026 00:325,40753,226,45340,514,0004,370,0002,117,632stderr