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 9, 2026 12:22wnwnScore: 3,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 12:233,39042,885,71227,091,0001,049,0002,482,176
2May 9, 2026 12:233,39641,982,71827,133,0001,058,0002,478,080
3May 9, 2026 12:233,40543,104,78327,191,0001,075,0002,486,272
4May 9, 2026 12:233,48643,545,89627,845,0001,089,0002,494,464
5May 9, 2026 12:233,53448,010,09128,279,0001,061,0002,478,080
6May 9, 2026 12:233,54545,723,08128,363,0001,064,0002,478,080
7May 9, 2026 12:233,55843,764,65228,462,0001,070,0002,473,984
8May 9, 2026 12:233,56946,142,80528,538,0001,089,0002,482,176
9May 9, 2026 12:233,57845,964,51828,613,0001,088,0002,486,272