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:25wnwnScore: 3,439Success
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:263,42536,910,17927,425,0001,004,0002,113,536
2Sep 5, 2026 13:263,42936,904,62827,423,0001,038,0002,113,536
3Sep 5, 2026 13:263,43036,921,66227,440,0001,033,0002,113,536
4Sep 5, 2026 13:263,43736,779,53127,515,0001,018,0002,113,536
5Sep 5, 2026 13:263,43937,035,32827,545,0001,002,0002,113,536
6Sep 5, 2026 13:263,51337,649,74728,155,0001,003,0002,113,536
7Sep 5, 2026 13:263,57338,728,18128,625,0001,039,0002,113,536
8Sep 5, 2026 13:263,59438,877,09828,828,0001,005,0002,113,536
9Sep 5, 2026 13:263,61338,526,22928,953,0001,041,0002,113,536