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 listMar 15, 2026 08:10eldon-chungeldon-chungScore: 45,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 08:1045,003407,618,588371,532,0001,997,0002,277,376
2Mar 15, 2026 08:0945,009397,974,383371,576,0001,997,0002,269,184
3Mar 15, 2026 08:1045,010404,554,457371,585,0001,997,0002,514,944
4Mar 15, 2026 08:0945,011401,954,548372,595,000998,0002,265,088
5Mar 15, 2026 08:1045,011398,474,346372,595,000998,0002,277,376
6Mar 15, 2026 08:1045,020398,862,172372,665,000999,0002,363,392
7Mar 15, 2026 08:1045,029398,292,488371,742,0001,998,0002,265,088
8Mar 15, 2026 08:1045,032402,714,183371,770,0001,998,0002,285,568
9Mar 15, 2026 08:0946,698418,814,200386,598,000998,0002,285,568