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 listMay 11, 2026 07:34wnwnScore: 3,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:343,40437,335,67427,260,0001,001,0002,113,536
2May 11, 2026 07:343,43035,747,49927,473,0001,004,0002,113,536
3May 11, 2026 07:343,43837,438,54127,527,0001,009,0002,113,536
4May 11, 2026 07:343,55537,437,10529,508,00002,113,536
5May 11, 2026 07:343,55740,284,98828,529,0001,001,0002,113,536
6May 11, 2026 07:343,57739,152,12229,692,00002,113,536
7May 11, 2026 07:343,59339,609,69328,800,0001,026,0002,113,536
8May 11, 2026 07:343,60637,568,61028,928,0001,008,0002,113,536
9May 11, 2026 07:343,60740,112,80828,936,0001,003,0002,113,536