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 listJan 1, 2023 17:48UdbhavUdbhavScore: 59,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2023 17:4559,164553,511,289491,058,97202,224,128
2Jan 1, 2023 17:4559,321554,801,454492,366,56202,224,128
3Jan 1, 2023 17:4859,343552,477,133492,544,00102,228,224
4Jan 1, 2023 17:4859,386559,553,058492,906,72302,236,416
5Jan 1, 2023 17:4859,395563,619,283492,975,38102,228,224
6Jan 1, 2023 17:4560,110592,397,117498,912,04202,224,128