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 listMay 11, 2025 19:44vahookvahookScore: 4,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2025 19:444,75057,460,32637,406,0002,021,0002,273,280
2May 11, 2025 19:444,75864,271,58837,464,0002,025,0002,273,280
3May 11, 2025 19:444,76162,015,03235,466,0004,053,0002,273,280
4May 11, 2025 19:444,76368,431,85336,495,0003,041,0002,273,280
5May 11, 2025 19:444,77864,009,96337,627,0002,033,0002,441,216
6May 11, 2025 19:444,80261,489,00436,866,0002,989,0002,473,984
7May 11, 2025 19:444,81760,428,65936,986,0002,998,0002,433,024
8May 11, 2025 19:444,83557,869,39138,128,0002,006,0002,441,216
9May 11, 2025 19:444,86876,871,00938,384,0002,020,0002,437,120
10May 11, 2025 19:444,92760,269,71635,905,0004,986,0002,437,120
11May 11, 2025 19:444,92864,481,55136,910,0003,990,0002,273,280
12May 11, 2025 19:444,95268,572,97238,097,0003,007,0002,273,280