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 15:53M-RochatM-RochatScore: 23,243Success
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 15:5423,095210,099,144190,640,0001,049,0002,465,792
2May 5, 2026 15:5423,155209,586,813190,987,0001,207,0002,457,600
3May 5, 2026 15:5423,215211,787,975191,618,0001,067,0002,469,888
4May 5, 2026 15:5423,235211,964,062191,839,0001,012,0002,461,696
5May 5, 2026 15:5423,243211,847,133191,887,0001,031,0002,478,080
6May 5, 2026 15:5423,490212,968,583193,940,0001,029,0002,469,888
7May 5, 2026 15:5423,744213,235,943196,068,0001,009,0002,461,696
8May 5, 2026 15:5425,244224,763,339208,494,0001,038,0002,457,600
9May 5, 2026 15:5425,341229,817,023209,304,0001,029,0002,461,696