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 6, 2026 11:54CheckHarryCheckHarryScore: 6,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 11:556,39562,898,49552,044,0001,042,0002,113,536
2Sep 6, 2026 11:556,43163,344,69952,322,0001,062,0002,113,536
3Sep 6, 2026 11:556,48863,763,70552,812,0001,046,0002,113,536
4Sep 6, 2026 11:556,48963,768,51352,828,0001,037,0002,113,536
5Sep 6, 2026 11:556,49163,801,16352,834,0001,047,0002,113,536
6Sep 6, 2026 11:556,49363,670,96152,861,0001,034,0002,113,536
7Sep 6, 2026 11:556,50063,768,61252,900,0001,050,0002,113,536
8Sep 6, 2026 11:556,58064,544,93153,577,0001,045,0002,113,536
9Sep 6, 2026 11:556,58764,519,13753,636,0001,040,0002,113,536