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 listApr 24, 2026 14:06olliecrowolliecrowScore: 6,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 14:066,38769,190,02751,014,0002,000,0002,461,696
2Apr 24, 2026 14:066,40966,856,85049,182,0004,014,0002,494,464
3Apr 24, 2026 14:066,43975,064,48650,424,0003,025,0002,514,944
4Apr 24, 2026 14:066,43968,721,55850,425,0003,025,0002,433,024
5Apr 24, 2026 14:066,45065,583,07451,516,0002,020,0002,428,928
6Apr 24, 2026 14:066,45567,876,18550,550,0003,033,0002,482,176
7Apr 24, 2026 14:066,48672,839,57650,847,0002,991,0002,482,176
8Apr 24, 2026 14:066,51571,484,92051,072,0003,004,0002,519,040
9Apr 24, 2026 14:066,55074,517,20752,355,0002,013,0002,404,352