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 20, 2026 11:02Victor MerckléVictor MerckléScore: 5,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 11:035,67556,750,45846,094,0001,010,0002,113,536
2May 20, 2026 11:035,67656,905,98746,099,0001,020,0002,113,536
3May 20, 2026 11:035,85658,999,73247,588,0001,023,0002,113,536
4May 20, 2026 11:035,87056,704,96147,687,0001,039,0002,113,536
5May 20, 2026 11:035,87858,756,11347,751,0001,038,0002,113,536
6May 20, 2026 11:035,89257,561,55047,883,0001,028,0002,113,536
7May 20, 2026 11:035,89358,440,75147,884,0001,029,0002,113,536
8May 20, 2026 11:035,89956,906,26247,961,0001,004,0002,113,536
9May 20, 2026 11:035,90058,525,69647,957,0001,021,0002,113,536