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 29, 2026 07:11Karthik ReddyKarthik ReddyScore: 5,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 07:115,93659,582,18048,179,0001,095,0002,113,536
2Sep 29, 2026 07:115,93859,700,23948,182,0001,110,0002,113,536
3Sep 29, 2026 07:115,94159,703,44648,208,0001,110,0002,113,536
4Sep 29, 2026 07:115,94759,745,55748,258,0001,109,0002,113,536
5Sep 29, 2026 07:115,94859,723,65648,270,0001,100,0002,113,536
6Sep 29, 2026 07:115,95259,691,18248,321,0001,087,0002,113,536
7Sep 29, 2026 07:115,95459,760,49348,284,0001,138,0002,113,536
8Sep 29, 2026 07:115,96059,799,15948,369,0001,101,0002,113,536
9Sep 29, 2026 07:115,98659,995,51448,591,0001,101,0002,113,536