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 listFeb 23, 2025 15:28AndrewAndrewScore: 63,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2025 15:2863,576550,272,577526,684,000999,0002,269,184
2Feb 23, 2025 15:2863,592559,257,858526,817,000999,0002,265,088
3Feb 23, 2025 15:2863,597547,614,658524,859,0002,999,0002,277,376
4Feb 23, 2025 15:2863,603553,629,188524,910,0002,999,0002,277,376
5Feb 23, 2025 15:2863,618550,834,105525,030,0003,000,0002,277,376
6Feb 23, 2025 15:2863,619552,682,326525,038,0003,000,0002,273,280
7Feb 23, 2025 15:2863,622547,861,782526,064,0002,000,0002,277,376
8Feb 23, 2025 15:2863,643554,182,484526,237,0002,000,0002,277,376
9Feb 23, 2025 15:2863,650550,265,871527,291,0001,000,0002,277,376