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 15, 2025 20:48T PrathamT PrathamScore: 69,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2025 20:4869,583604,266,393575,537,0001,998,0002,273,280
2May 15, 2025 20:4869,585605,428,677575,559,0001,998,0002,269,184
3May 15, 2025 20:4869,598601,038,915575,664,0001,998,0002,285,568
4May 15, 2025 20:4869,602598,512,205575,696,0001,998,0002,285,568
5May 15, 2025 20:4869,606599,748,500575,729,0001,999,0002,285,568
6May 15, 2025 20:4869,606599,869,538575,728,0001,999,0002,281,472
7May 15, 2025 20:4869,610603,840,468575,765,0001,999,0002,285,568
8May 15, 2025 20:4869,610598,574,702576,763,000999,0002,269,184
9May 15, 2025 20:4869,613599,716,071575,787,0001,999,0002,285,568