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 12:54wnwnScore: 3,466Success
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 12:553,31836,008,50426,535,0001,006,0002,113,536
2Sep 5, 2026 12:553,32035,997,39426,532,0001,027,0002,113,536
3Sep 5, 2026 12:553,33435,927,64526,667,0001,007,0002,113,536
4Sep 5, 2026 12:553,43538,506,12927,469,0001,042,0002,113,536
5Sep 5, 2026 12:553,46637,060,62827,758,0001,016,0002,113,536
6Sep 5, 2026 12:553,51738,314,25428,186,0001,010,0002,113,536
7Sep 5, 2026 12:553,52038,316,72728,206,0001,011,0002,113,536
8Sep 5, 2026 12:553,53638,475,43328,343,0001,010,0002,113,536
9Sep 5, 2026 12:553,55538,116,71228,504,0001,010,0002,113,536