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 listMay 10, 2026 10:24wnwnScore: 3,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:253,39345,189,76727,095,0001,068,0002,482,176
2May 10, 2026 10:253,39745,397,05727,142,0001,061,0002,490,368
3May 10, 2026 10:253,39842,506,71827,158,0001,048,0002,482,176
4May 10, 2026 10:253,40043,021,10827,098,0001,123,0002,490,368
5May 10, 2026 10:253,40041,326,88927,166,0001,061,0002,478,080
6May 10, 2026 10:253,41342,426,04127,277,0001,059,0002,478,080
7May 10, 2026 10:253,54446,275,46528,296,0001,126,0002,478,080
8May 10, 2026 10:253,54942,385,23528,394,0001,068,0002,494,464
9May 10, 2026 10:253,56243,582,90228,501,0001,066,0002,478,080