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 listJun 7, 2024 11:35GraceGraceScore: 84,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 11:3583,747778,895,932695,096,44702,248,704
2Jun 7, 2024 11:3583,955752,507,857696,828,16202,244,608
3Jun 7, 2024 11:3584,025756,233,880697,403,76502,244,608
4Jun 7, 2024 11:3584,068763,421,272697,763,31802,252,800
5Jun 7, 2024 11:3584,421763,986,321700,693,77102,248,704
6Jun 7, 2024 11:3584,467764,044,135701,076,44302,240,512
7Jun 7, 2024 11:3584,556770,704,498701,816,51902,248,704
8Jun 7, 2024 11:3584,767767,923,287703,569,75902,240,512
9Jun 7, 2024 11:3584,772764,457,263703,611,03002,244,608
10Jun 7, 2024 11:3584,918759,330,392704,822,55102,367,488
11Jun 7, 2024 11:3585,092765,521,557706,264,34602,232,320
12Jun 7, 2024 11:3585,319779,880,537708,151,22602,371,584