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 24, 2024 09:22Ilango RajagopalIlango RajagopalScore: 74,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2024 09:2274,132647,723,340435,502,000179,794,0002,457,600
2Sep 24, 2024 09:2274,540642,991,172436,774,000181,905,0002,453,504
3Sep 24, 2024 09:2274,587650,885,193434,352,000184,724,0002,461,696
4Sep 24, 2024 09:2274,739646,706,033435,531,000184,801,0002,494,464
5Sep 24, 2024 09:2274,785646,881,603437,800,000182,916,0002,457,600
6Sep 24, 2024 09:2274,790647,691,155436,828,000183,927,0002,465,792
7Sep 24, 2024 09:2275,063649,137,258436,019,000187,008,0002,359,296
8Sep 24, 2024 09:2275,335654,740,907438,497,000186,786,0002,281,472
9Sep 24, 2024 09:2276,281661,507,181437,402,000195,732,0002,420,736