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 06:46M-RochatM-RochatScore: 11,896Success
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 06:4711,866109,901,86396,430,0002,059,0002,113,536
2May 20, 2026 06:4711,880110,142,33496,534,0002,071,0002,113,536
3May 20, 2026 06:4711,887109,085,98596,601,0002,062,0002,113,536
4May 20, 2026 06:4711,890109,743,05196,624,0002,067,0002,113,536
5May 20, 2026 06:4711,896111,076,29396,674,0002,069,0002,113,536
6May 20, 2026 06:4711,898111,264,45796,686,0002,074,0002,113,536
7May 20, 2026 06:4711,899111,150,96596,702,0002,062,0002,113,536
8May 20, 2026 06:4711,908108,838,66296,761,0002,077,0002,113,536
9May 20, 2026 06:4711,911110,741,10296,789,0002,077,0002,113,536