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 listOct 14, 2024 00:48Joad NacerJoad NacerScore: 7,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:484,48962,336,62235,245,0002,014,0002,297,856
2Oct 14, 2024 00:484,87065,906,79737,389,0003,031,0002,306,048
3Oct 14, 2024 00:484,92072,264,99639,838,000995,0002,306,048
4Oct 14, 2024 00:487,08691,621,79734,889,00023,924,0002,359,296
5Oct 14, 2024 00:487,12885,349,81843,120,00016,044,0002,330,624
6Oct 14, 2024 00:487,44391,887,65946,832,00014,946,0002,359,296