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 04:28CheckHarryCheckHarryScore: 9,274Success
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 04:289,22186,328,41975,458,0001,078,0002,113,536
2Sep 3, 2026 04:289,23086,490,16875,576,0001,039,0002,113,536
3Sep 3, 2026 04:289,25886,751,39375,789,0001,055,0002,113,536
4Sep 3, 2026 04:289,25886,734,44375,624,0001,225,0002,113,536
5Sep 3, 2026 04:289,27486,774,13575,942,0001,040,0002,113,536
6Sep 3, 2026 04:289,27686,816,53175,951,0001,048,0002,113,536
7Sep 3, 2026 04:289,29087,103,16276,070,0001,041,0002,113,536
8Sep 3, 2026 04:289,30687,136,12876,186,0001,061,0002,113,536
9Sep 3, 2026 04:289,31887,230,71376,305,0001,041,0002,113,536