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:33M-RochatM-RochatScore: 13,448Success
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:3413,261120,102,741107,746,0002,321,0002,113,536
2May 20, 2026 05:3413,316120,194,218108,196,0002,332,0002,113,536
3May 20, 2026 05:3413,330121,579,577108,628,0002,014,0002,113,536
4May 20, 2026 05:3413,363120,964,904108,574,0002,343,0002,113,536
5May 20, 2026 05:3413,448123,209,050109,617,0002,008,0002,113,536
6May 20, 2026 05:3413,472123,056,497109,772,0002,047,0002,113,536
7May 20, 2026 05:3413,490122,072,560109,913,0002,057,0002,113,536
8May 20, 2026 05:3413,498121,980,545109,969,0002,066,0002,113,536
9May 20, 2026 05:3413,516122,296,854110,118,0002,067,0002,113,536