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 listNov 5, 2025 11:02caandocaandoScore: 6,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 11:025,89570,529,73646,931,0001,997,0002,285,568
2Nov 5, 2025 11:025,89669,986,86746,940,0001,997,0002,265,088
3Nov 5, 2025 11:025,91378,431,63347,074,0002,003,0002,514,944
4Nov 5, 2025 11:026,01973,382,88548,960,000999,0002,265,088
5Nov 5, 2025 11:026,04072,022,86649,129,0001,002,0002,285,568
6Nov 5, 2025 11:026,14775,334,86849,017,0002,000,0002,277,376