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 01:12DanusanDanusanScore: 305,336Success
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 01:12304,5922,564,583,6732,181,507,000346,604,0002,441,216
2Sep 19, 2024 01:12304,7902,570,751,8322,176,349,000353,407,0002,506,752
3Sep 19, 2024 01:12305,1742,574,853,7442,183,501,000349,440,0002,498,560
4Sep 19, 2024 01:12305,2102,570,697,2242,156,656,000376,590,0002,441,216
5Sep 19, 2024 01:12305,3362,570,705,8522,164,537,000369,750,0002,469,888
6Sep 19, 2024 01:12305,4232,574,005,0432,179,013,000356,002,0002,449,408
7Sep 19, 2024 01:12305,4332,568,835,4012,155,378,000379,714,0002,519,040
8Sep 19, 2024 01:12305,5372,575,891,4842,133,444,000402,517,0002,510,848
9Sep 19, 2024 01:12306,1632,577,607,6662,172,567,000368,587,0002,465,792