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 20, 2025 23:05Cameron AavikCameron AavikScore: 34,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2025 23:0533,952306,078,362218,849,00062,956,0002,535,424
2Jan 20, 2025 23:0533,996310,145,486220,128,00062,036,0002,293,760
3Jan 20, 2025 23:0534,076310,936,979221,868,00060,963,0002,293,760
4Jan 20, 2025 23:0534,082308,051,058221,909,00060,975,0002,293,760
5Jan 20, 2025 23:0534,110307,534,477222,089,00061,024,0002,289,664
6Jan 20, 2025 23:0534,121308,902,405211,153,00072,052,0002,535,424
7Jan 20, 2025 23:0534,144303,964,290218,303,00065,090,0002,293,760
8Jan 20, 2025 23:0534,231312,077,031221,094,00063,026,0002,539,520
9Jan 20, 2025 23:0534,624313,754,484231,304,00056,073,0002,289,664