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 20, 2026 05:35M-RochatM-RochatScore: 12,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:3512,541113,920,174101,756,0002,336,0002,113,536
2May 20, 2026 05:3512,544115,232,472101,780,0002,337,0002,113,536
3May 20, 2026 05:3512,553114,935,506102,160,0002,031,0002,113,536
4May 20, 2026 05:3512,566115,466,287101,963,0002,343,0002,113,536
5May 20, 2026 05:3512,574115,937,888102,353,0002,016,0002,113,536
6May 20, 2026 05:3512,579113,880,773102,368,0002,041,0002,113,536
7May 20, 2026 05:3512,582114,386,371102,423,0002,013,0002,113,536
8May 20, 2026 05:3512,586113,821,766102,458,0002,009,0002,113,536
9May 20, 2026 05:3512,600116,199,832102,533,0002,053,0002,113,536