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 05:28CheckHarryCheckHarryScore: 5,555Success
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 05:295,51455,635,18344,749,0001,023,0002,113,536
2Sep 3, 2026 05:295,54855,929,95445,029,0001,021,0002,113,536
3Sep 3, 2026 05:295,55256,015,72544,041,0002,045,0002,113,536
4Sep 3, 2026 05:295,55555,903,96944,092,0002,017,0002,113,536
5Sep 3, 2026 05:295,55555,982,21045,088,0001,021,0002,113,536
6Sep 3, 2026 05:295,57757,307,74444,250,0002,045,0002,113,536
7Sep 3, 2026 05:295,60556,420,91744,511,0002,015,0002,113,536
8Sep 3, 2026 05:295,62856,605,50244,468,0002,252,0002,113,536
9Sep 3, 2026 05:295,76357,735,41145,835,0002,000,0002,113,536