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 10, 2021 06:23Andrey TsvetkovAndrey TsvetkovScore: 33,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2021 21:3133,177349,361,980275,373,00902,240,512
2Sep 10, 2021 06:2333,188337,727,262275,457,43402,240,512
3Sep 29, 2021 21:3133,190335,473,454275,475,09302,236,416
4Sep 10, 2021 06:2133,191339,139,210275,487,82302,240,512
5Sep 10, 2021 06:2133,201358,051,877275,565,43102,252,800
6Sep 10, 2021 06:2333,203349,323,150275,582,00402,244,608
7Sep 10, 2021 06:2133,207340,164,358275,621,34602,248,704
8Sep 29, 2021 21:3133,207334,983,596275,620,78502,236,416
9Sep 10, 2021 06:2333,217342,030,372275,699,60702,240,512