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 listSep 3, 2026 04:35CheckHarryCheckHarryScore: 8,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:358,60281,246,46170,247,0001,157,0002,113,536
2Sep 3, 2026 04:358,60681,308,47770,383,0001,053,0002,113,536
3Sep 3, 2026 04:358,62581,519,57870,529,0001,059,0002,113,536
4Sep 3, 2026 04:358,62781,474,86170,563,0001,044,0002,113,536
5Sep 3, 2026 04:358,62881,502,25770,528,0001,086,0002,113,536
6Sep 3, 2026 04:358,63181,500,46070,634,0001,004,0002,113,536
7Sep 3, 2026 04:358,63290,713,02970,634,0001,015,0002,113,536
8Sep 3, 2026 04:358,63581,665,87770,625,0001,052,0002,113,536
9Sep 3, 2026 04:358,64481,563,15770,704,0001,042,0002,113,536