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 listFeb 12, 2026 04:29olliecrowolliecrowScore: 6,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 04:295,58473,832,86044,331,0002,015,0002,281,472
2Feb 12, 2026 04:295,64978,905,31845,886,000997,0002,445,312
3Feb 12, 2026 04:295,82176,668,23446,304,0002,013,0002,392,064
4Feb 12, 2026 04:295,90977,332,65647,042,0002,001,0002,424,832
5Feb 12, 2026 04:295,99675,329,13147,777,0001,990,0002,383,872
6Feb 12, 2026 04:296,02176,216,82746,976,0002,998,0002,301,952
7Feb 12, 2026 04:296,02373,797,52145,990,0003,999,0002,486,272
8Feb 12, 2026 04:296,03075,185,38348,047,0002,001,0002,363,392
9Feb 12, 2026 04:296,12580,315,88549,823,0001,016,0002,478,080
10Feb 12, 2026 04:296,12877,727,77948,870,0001,994,0002,277,376
11Feb 12, 2026 04:296,13284,052,67349,901,000998,0002,514,944
12Feb 12, 2026 04:296,15875,604,17550,112,0001,002,0002,441,216