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 4, 2026 21:12M-RochatM-RochatScore: 30,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 21:1230,321268,980,288250,658,0001,008,0002,465,792
2May 4, 2026 21:1230,381268,897,910251,157,0001,006,0002,469,888
3May 4, 2026 21:1230,425272,098,922251,522,0001,008,0002,465,792
4May 4, 2026 21:1230,450267,934,742251,730,0001,006,0002,465,792
5May 4, 2026 21:1230,471267,740,447251,906,0001,005,0002,469,888
6May 4, 2026 21:1230,714272,091,792253,921,0001,009,0002,469,888
7May 4, 2026 21:1230,805271,394,690254,682,0001,007,0002,461,696
8May 4, 2026 21:1230,816271,627,035254,769,0001,006,0002,478,080
9May 4, 2026 21:1230,898273,177,000255,449,0001,008,0002,473,984