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 listOct 27, 2025 08:00Weitao WanWeitao WanScore: 41,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 08:0041,123367,535,704340,323,0001,000,0002,289,664
2Oct 27, 2025 08:0041,127367,117,124340,350,0001,001,0002,277,376
3Oct 27, 2025 08:0041,130365,001,301340,378,0001,001,0002,277,376
4Oct 27, 2025 08:0041,134371,360,139340,409,0001,001,0002,269,184
5Oct 27, 2025 08:0041,145369,570,251339,504,0001,997,0002,273,280
6Oct 27, 2025 08:0041,148368,012,430340,531,0001,001,0002,363,392
7Oct 27, 2025 08:0041,150368,777,577340,550,000998,0002,289,664
8Oct 27, 2025 08:0041,151373,940,871341,554,00002,281,472
9Oct 27, 2025 08:0041,161366,230,955339,642,0001,997,0002,289,664