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 2, 2026 22:13javivallejojavivallejoScore: 46,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 22:1345,917405,087,444379,109,0002,000,0002,375,680
2Feb 2, 2026 22:1345,986412,717,017379,684,0001,998,0002,519,040
3Feb 2, 2026 22:1345,997412,763,347380,779,000999,0002,289,664
4Feb 2, 2026 22:1345,997408,530,006379,777,0001,998,0002,289,664
5Feb 2, 2026 22:1346,003410,956,259379,827,0001,999,0002,265,088
6Feb 2, 2026 22:1346,004411,008,582379,836,0001,999,0002,289,664
7Feb 2, 2026 22:1346,006413,869,382379,852,0001,999,0002,273,280
8Feb 2, 2026 22:1346,028406,671,067380,034,0002,000,0002,289,664
9Feb 2, 2026 22:1346,340413,100,468382,620,0001,998,0002,289,664