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 listJan 31, 2026 00:11olliecrowolliecrowScore: 9,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 00:118,13399,497,45165,490,0002,015,0002,469,888
2Jan 31, 2026 00:118,25896,712,28265,518,0003,023,0002,293,760
3Jan 31, 2026 00:118,43590,723,25367,009,0003,000,0002,347,008
4Jan 31, 2026 00:119,613110,237,01875,749,0004,039,0002,260,992
5Jan 31, 2026 00:119,638105,266,21676,997,0002,999,0002,473,984
6Jan 31, 2026 00:119,688103,370,78178,404,0002,010,0002,301,952
7Jan 31, 2026 00:119,735107,457,04577,806,0002,992,0002,490,368
8Jan 31, 2026 00:119,741102,584,08577,859,0002,994,0002,285,568
9Jan 31, 2026 00:119,752106,907,40976,943,0003,997,0002,265,088
10Jan 31, 2026 00:119,773107,442,98378,110,0003,004,0002,277,376
11Jan 31, 2026 00:119,779108,553,20779,164,0002,004,0002,367,488
12Jan 31, 2026 00:1110,061111,610,79981,491,0002,012,0002,506,752