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 listJul 7, 2026 12:44Kevin HeaveyKevin HeaveyScore: 5,696Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:445,65456,514,46545,692,0001,238,0002,117,632
2Jul 7, 2026 12:445,67756,769,98345,841,0001,282,0002,117,632
3Jul 7, 2026 12:445,68156,675,13545,895,0001,258,0002,117,632
4Jul 7, 2026 12:445,69056,816,86946,051,0001,179,0002,117,632
5Jul 7, 2026 12:445,69656,853,05546,080,0001,204,0002,117,632
6Jul 7, 2026 12:445,69956,859,82546,076,0001,229,0002,117,632
7Jul 7, 2026 12:445,70256,849,17046,171,0001,162,0002,117,632
8Jul 7, 2026 12:445,72557,113,23946,283,0001,241,0002,117,632
9Jul 7, 2026 12:445,77257,494,74546,759,0001,156,0002,117,632