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:24wnwnScore: 3,579Success
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:243,46337,197,06227,709,0001,035,0002,113,536
2Sep 5, 2026 13:243,47137,345,47027,805,0001,010,0002,113,536
3Sep 5, 2026 13:243,47537,338,37827,839,0001,004,0002,113,536
4Sep 5, 2026 13:243,48137,425,10927,885,0001,008,0002,113,536
5Sep 5, 2026 13:243,57938,182,71228,700,0001,006,0002,113,536
6Sep 5, 2026 13:243,58238,226,83728,695,0001,042,0002,113,536
7Sep 5, 2026 13:243,60538,390,70228,886,0001,042,0002,113,536
8Sep 5, 2026 13:243,65438,728,21529,292,0001,044,0002,113,536
9Sep 5, 2026 13:243,65539,443,82429,339,0001,002,0002,113,536