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 2, 2026 17:05CheckHarryCheckHarryScore: 6,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 17:076,52764,022,97453,129,0001,050,0002,113,536
2Sep 2, 2026 17:076,53264,048,30653,176,0001,042,0002,113,536
3Sep 2, 2026 17:076,53964,159,58753,243,0001,036,0002,113,536
4Sep 2, 2026 17:076,54564,203,08353,278,0001,048,0002,113,536
5Sep 2, 2026 17:076,55465,057,55453,355,0001,044,0002,113,536
6Sep 2, 2026 17:076,56564,377,56953,442,0001,051,0002,113,536
7Sep 2, 2026 17:076,56864,388,25253,470,0001,049,0002,113,536
8Sep 2, 2026 17:076,57564,445,46353,535,0001,041,0002,113,536
9Sep 2, 2026 17:076,58464,583,78153,598,0001,051,0002,113,536