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 5, 2026 13:43wnwnScore: 3,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:443,33335,887,44726,656,0001,010,0002,113,536
2Sep 5, 2026 13:443,33636,136,55226,660,0001,035,0002,113,536
3Sep 5, 2026 13:443,33636,146,48626,667,0001,026,0002,113,536
4Sep 5, 2026 13:443,33836,119,47726,669,0001,037,0002,113,536
5Sep 5, 2026 13:443,34536,279,20126,754,0001,013,0002,113,536
6Sep 5, 2026 13:443,35136,071,88426,808,0001,006,0002,113,536
7Sep 5, 2026 13:443,35436,259,55526,805,0001,038,0002,113,536
8Sep 5, 2026 13:443,45437,154,71627,665,0001,008,0002,113,536
9Sep 5, 2026 13:443,51538,367,01528,163,0001,019,0002,113,536