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 16, 2025 11:26ttmxttmxScore: 117,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 11:26117,1301,001,059,223748,368,000223,811,0002,453,504
2Jan 16, 2025 11:26117,3841,000,181,969748,456,000225,835,0002,453,504
3Jan 16, 2025 11:26117,4461,004,393,205747,847,000226,953,0002,449,408
4Jan 16, 2025 11:26117,4811,001,344,675748,305,000226,789,0002,424,832
5Jan 16, 2025 11:26117,5051,004,096,063748,458,000226,836,0002,289,664
6Jan 16, 2025 11:26117,5171,006,101,174747,532,000227,857,0002,367,488
7Jan 16, 2025 11:26117,6291,000,503,771747,478,000228,840,0002,465,792
8Jan 16, 2025 11:26117,7661,002,607,005747,587,000229,873,0002,461,696
9Jan 16, 2025 11:26117,8811,002,385,957747,552,000230,861,0002,453,504