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 29, 2026 11:09wnwnScore: 3,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 11:103,27335,989,85727,167,000020,480
2Sep 29, 2026 11:103,28336,067,05127,249,000020,480
3Sep 29, 2026 11:103,28636,181,03927,282,000020,480
4Sep 29, 2026 11:103,35036,725,63027,813,000020,480
5Sep 29, 2026 11:103,44337,430,18528,581,000020,480
6Sep 29, 2026 11:103,44537,563,24028,595,000020,480
7Sep 29, 2026 11:103,47737,722,58228,863,000020,480
8Sep 29, 2026 11:103,49137,816,11228,977,000020,480
9Sep 29, 2026 11:103,49139,626,48928,983,000020,480