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 12, 2026 00:25Victor MerckléVictor MerckléScore: 10,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:2610,09595,502,76082,704,0001,089,0002,113,536
2May 12, 2026 00:2610,09693,087,62582,692,0001,110,0002,113,536
3May 12, 2026 00:2610,11292,879,65082,761,0001,174,0002,113,536
4May 12, 2026 00:2610,11293,444,65682,758,0001,179,0002,113,536
5May 12, 2026 00:2610,11494,945,16382,947,0001,005,0002,113,536
6May 12, 2026 00:2610,11594,765,21682,758,0001,199,0002,113,536
7May 12, 2026 00:2610,12494,939,28682,853,0001,179,0002,113,536
8May 12, 2026 00:2610,12894,969,69583,005,0001,061,0002,113,536
9May 12, 2026 00:2610,15293,670,48983,253,0001,011,0002,113,536