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 listDec 27, 2022 10:13@AirM4rx@AirM4rxScore: 374,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2022 10:16314,3353,558,255,4832,608,977,63702,265,088
2Dec 27, 2022 10:16314,4493,727,653,0092,609,930,53502,318,336
3Dec 27, 2022 10:16315,8903,520,343,6832,621,890,04502,301,952
4Dec 27, 2022 10:15372,3396,522,088,4603,090,413,66002,248,704
5Dec 27, 2022 10:15374,8356,707,098,1553,111,133,33402,277,376
6Dec 27, 2022 10:15387,2378,356,233,9513,214,068,73802,203,648
7Dec 27, 2022 10:13488,38414,375,073,6994,053,583,94802,260,992
8Dec 27, 2022 10:13489,36014,079,700,7044,061,689,09302,224,128
9Dec 27, 2022 10:13489,87214,308,930,2154,065,937,56602,306,048