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 listMay 20, 2026 19:53Victor MerckléVictor MerckléScore: 9,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:549,55387,920,76078,224,0001,067,0002,117,632stderr
2May 20, 2026 19:549,55389,067,80278,220,0001,070,0002,117,632stderr
3May 20, 2026 19:549,58090,327,37878,425,0001,091,0002,117,632stderr
4May 20, 2026 19:549,60188,070,91778,688,0001,004,0002,117,632stderr
5May 20, 2026 19:549,61289,701,46678,775,0001,007,0002,117,632stderr
6May 20, 2026 19:549,62088,122,74978,810,0001,044,0002,117,632stderr
7May 20, 2026 19:549,62689,952,48278,870,0001,029,0002,117,632stderr
8May 20, 2026 19:549,64588,569,20078,975,0001,080,0002,117,632stderr
9May 20, 2026 19:549,74889,841,96779,888,0001,026,0002,117,632stderr