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 5, 2026 09:27Kevin HeaveyKevin HeaveyScore: 3,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 09:293,58239,959,38628,679,0001,052,0002,117,632
2Sep 5, 2026 09:293,60640,133,69128,885,0001,046,0002,117,632
3Sep 5, 2026 09:293,61540,169,32628,965,0001,046,0002,117,632
4Sep 5, 2026 09:293,83842,054,54630,812,0001,045,0002,117,632
5Sep 5, 2026 09:293,85742,215,68030,972,0001,044,0002,117,632
6Sep 5, 2026 09:293,86942,245,38531,092,0001,026,0002,117,632
7Sep 5, 2026 09:293,88042,384,79531,163,0001,049,0002,117,632
8Sep 5, 2026 09:293,88542,425,94031,222,0001,025,0002,117,632
9Sep 5, 2026 09:293,88542,458,65231,209,0001,042,0002,117,632