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 2, 2026 13:24limanjun99limanjun99Score: 20,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2026 13:2520,307183,603,114166,544,0002,006,0002,457,600
2May 2, 2026 13:2520,308190,484,767166,558,0002,006,0002,457,600
3May 2, 2026 13:2520,310192,944,793166,573,0002,006,0002,469,888
4May 2, 2026 13:2520,312188,057,615165,604,0002,992,0002,469,888
5May 2, 2026 13:2520,321189,509,347165,675,0002,994,0002,347,008
6May 2, 2026 13:2520,322186,860,897165,685,0002,994,0002,461,696
7May 2, 2026 13:2520,322192,007,631166,666,0002,008,0002,457,600
8May 2, 2026 13:2520,325188,653,799165,704,0002,994,0002,465,792
9May 2, 2026 13:2520,344185,174,634165,865,0002,997,0002,535,424