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 12, 2026 04:04Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 04:05040,875,47531,000,0001,072,0002,113,536expected "53678118815589380 ", got "53678118571610041 "
2May 12, 2026 04:053,83442,057,15030,724,0001,100,0002,113,536
3May 12, 2026 04:053,84741,773,11330,785,0001,151,0002,113,536
4May 12, 2026 04:053,85239,653,96630,886,0001,090,0002,113,536
5May 12, 2026 04:053,85841,626,57030,928,0001,095,0002,113,536
6May 12, 2026 04:053,88941,927,16431,188,0001,091,0002,113,536
7May 12, 2026 04:053,90539,726,98831,352,0001,064,0002,113,536
8May 12, 2026 04:053,90540,173,88831,287,0001,127,0002,113,536
9May 12, 2026 04:053,91942,232,34931,422,0001,113,0002,113,536