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:41M-RochatM-RochatScore: 19,863Success
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:4219,735180,789,045162,607,0001,200,0002,461,696
2May 5, 2026 16:4219,737183,174,455162,648,0001,177,0002,478,080
3May 5, 2026 16:4219,796181,038,378163,141,0001,171,0002,482,176
4May 5, 2026 16:4219,804183,597,579163,210,0001,171,0002,478,080
5May 5, 2026 16:4219,863181,482,267163,716,0001,153,0002,469,888
6May 5, 2026 16:4219,952182,806,773164,434,0001,173,0002,473,984
7May 5, 2026 16:4219,975184,295,394164,589,0001,210,0002,465,792
8May 5, 2026 16:4220,000181,701,268164,819,0001,182,0002,469,888
9May 5, 2026 16:4222,868205,355,071188,621,0001,191,0002,478,080