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 listAug 9, 2026 20:14TonyTonyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2026 20:14012,780,41102,507,0002,121,728expected "53685690054502668 ", got "KPS=4kB MMU=4kB FilePMD=0kB ShmemPMD=509952kB "
2Aug 9, 2026 20:14012,843,41202,503,0002,121,728expected "53689438322846914 ", got "KPS=4kB MMU=4kB FilePMD=0kB ShmemPMD=509952kB "
3Aug 9, 2026 20:14012,778,22302,497,0002,121,728expected "53689063878413896 ", got "KPS=4kB MMU=4kB FilePMD=0kB ShmemPMD=509952kB "