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:42M-RochatM-RochatScore: 19,882Success
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:4319,636179,573,189161,837,0001,146,0002,478,080
2May 5, 2026 16:4319,687179,379,878162,280,0001,129,0002,473,984
3May 5, 2026 16:4319,710180,693,711162,432,0001,169,0002,453,504
4May 5, 2026 16:4319,731181,013,497162,609,0001,159,0002,482,176
5May 5, 2026 16:4319,882178,661,338163,845,0001,177,0002,465,792
6May 5, 2026 16:4319,945182,039,919164,398,0001,146,0002,465,792
7May 5, 2026 16:4319,984183,340,572164,705,0001,166,0002,473,984
8May 5, 2026 16:4320,078181,678,598165,502,0001,151,0002,473,984
9May 5, 2026 16:4320,111186,168,170165,775,0001,149,0002,465,792