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 5, 2026 16:40M-RochatM-RochatScore: 19,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 16:4119,664180,192,557162,043,0001,169,0002,478,080
2May 5, 2026 16:4119,770178,726,781162,943,0001,151,0002,465,792
3May 5, 2026 16:4119,778179,949,232162,991,0001,171,0002,461,696
4May 5, 2026 16:4119,792180,394,134163,270,0001,011,0002,473,984
5May 5, 2026 16:4119,829182,037,119163,581,0001,006,0002,473,984
6May 5, 2026 16:4119,851185,469,976163,601,0001,163,0002,465,792
7May 5, 2026 16:4119,854179,589,062163,619,0001,172,0002,473,984
8May 5, 2026 16:4120,113185,780,016165,774,0001,172,0002,473,984
9May 5, 2026 16:4120,195184,577,974166,446,0001,178,0002,465,792