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 listSep 19, 2024 02:41DanusanDanusanScore: 304,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2024 02:41301,6662,541,550,1272,169,116,000334,709,0002,514,944
2Sep 19, 2024 02:41303,1862,562,121,7642,140,974,000375,469,0002,482,176
3Sep 19, 2024 02:41304,1122,560,174,2122,159,546,000364,585,0002,465,792
4Sep 19, 2024 02:41304,2572,564,660,4422,152,583,000372,754,0002,465,792
5Sep 19, 2024 02:41304,6382,565,286,9002,184,697,000343,795,0002,465,792
6Sep 19, 2024 02:41305,1882,576,212,7442,185,330,000347,734,0002,449,408
7Sep 19, 2024 02:41305,1952,569,641,1132,166,388,000366,727,0002,457,600
8Sep 19, 2024 02:41305,2092,566,690,1422,158,647,000374,591,0002,502,656
9Sep 19, 2024 02:41307,2742,587,610,2492,183,607,000366,766,0002,461,696