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 21, 2026 15:50Victor MerckléVictor MerckléScore: 4,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 15:514,54545,556,04336,659,0001,071,0002,113,536
2May 21, 2026 15:514,55045,617,44836,715,0001,055,0002,113,536
3May 21, 2026 15:514,55245,877,35936,708,0001,074,0002,113,536
4May 21, 2026 15:514,56245,707,13436,808,0001,060,0002,113,536
5May 21, 2026 15:514,57345,882,75636,953,0001,008,0002,113,536
6May 21, 2026 15:514,57345,650,84436,910,0001,052,0002,113,536
7May 21, 2026 15:514,57745,832,21636,931,0001,062,0002,113,536
8May 21, 2026 15:514,59447,445,33637,069,0001,067,0002,113,536
9May 21, 2026 15:514,60447,706,92837,211,0001,006,0002,113,536