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 listApr 29, 2024 18:37Steve HanSteve HanScore: 17,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2024 18:3717,615207,723,369146,202,95102,252,800
2Apr 29, 2024 18:3817,615203,837,526146,205,64502,256,896
3Apr 29, 2024 18:3817,617216,917,178146,220,75002,256,896
4Apr 29, 2024 18:3717,620215,010,495146,247,84502,256,896
5Apr 29, 2024 18:4417,620208,398,700146,241,87402,256,896
6Apr 29, 2024 18:4417,651215,564,821146,502,71902,240,512
7Apr 29, 2024 18:3717,677220,524,431146,717,06502,244,608
8Apr 29, 2024 18:3817,677208,814,413146,715,82502,248,704
9Apr 29, 2024 18:4417,682218,752,681146,756,91802,248,704