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:14wnwnScore: 3,499Success
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:153,47637,531,99628,854,00002,113,536
2May 11, 2026 07:153,48038,457,92328,887,00002,113,536
3May 11, 2026 07:153,49238,453,55528,985,00002,113,536
4May 11, 2026 07:153,49338,633,69828,994,00002,113,536
5May 11, 2026 07:153,49936,628,63729,047,00002,113,536
6May 11, 2026 07:153,50739,101,52329,109,00002,113,536
7May 11, 2026 07:153,50837,362,05229,123,00002,113,536
8May 11, 2026 07:153,50936,953,86229,127,00002,113,536
9May 11, 2026 07:153,51236,703,43628,018,0001,136,0002,113,536