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 listFeb 18, 2026 21:08wnwnScore: 5,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 21:205,52572,395,67544,864,000996,0002,437,120
2Feb 18, 2026 21:205,52771,134,22842,879,0002,991,0002,535,424
3Feb 18, 2026 21:205,53170,057,85643,913,0001,996,0002,535,424
4Feb 18, 2026 21:205,53768,117,73142,964,0002,997,0002,441,216
5Feb 18, 2026 21:205,53970,157,43142,974,0002,998,0002,535,424
6Feb 18, 2026 21:205,54067,501,25843,983,0001,999,0002,535,424
7Feb 18, 2026 21:205,54067,714,20242,984,0002,998,0002,441,216
8Feb 18, 2026 21:205,66366,780,71544,001,0003,000,0002,437,120
9Feb 18, 2026 21:205,69368,212,29345,238,0002,010,0002,441,216
10Feb 18, 2026 21:105,91471,669,30746,085,0003,005,0002,539,520
11Feb 18, 2026 21:105,97771,963,72248,598,0001,012,0002,441,216
12Feb 18, 2026 21:106,02774,181,66449,020,0001,000,0002,535,424