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 18:53wnwnScore: 86,384Success
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 19:0086,356746,453,093715,757,000999,0002,404,352
2Feb 18, 2026 19:0086,361742,112,398715,794,000999,0002,281,472
3Feb 18, 2026 18:5386,374744,155,333714,908,0001,999,0002,281,472
4Feb 18, 2026 18:5386,384741,117,201714,988,0001,999,0002,281,472
5Feb 18, 2026 18:5386,417740,099,853716,259,0001,000,0002,281,472
6Feb 18, 2026 19:0086,417746,143,873716,262,0001,000,0002,539,520