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 12:53CheckHarryCheckHarryScore: 4,286Success
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 12:564,24845,127,73234,245,0001,018,0002,113,536
2Sep 3, 2026 12:564,24845,019,38234,235,0001,029,0002,113,536
3Sep 3, 2026 12:564,25545,087,15134,305,0001,016,0002,113,536
4Sep 3, 2026 12:564,27145,291,55034,439,0001,018,0002,113,536
5Sep 3, 2026 12:564,28645,491,48734,552,0001,023,0002,113,536
6Sep 3, 2026 12:564,38846,210,81535,405,0001,017,0002,113,536
7Sep 3, 2026 12:564,40146,347,15535,517,0001,017,0002,113,536
8Sep 3, 2026 12:564,44446,813,03735,875,0001,015,0002,113,536
9Sep 3, 2026 12:564,48948,521,25936,247,0001,015,0002,113,536