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 13, 2026 17:44Victor MerckléVictor MerckléScore: 69,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:4469,647587,117,246577,017,0001,058,0002,117,632stderr
2May 13, 2026 17:4469,700587,929,768577,340,0001,177,0002,117,632stderr
3May 13, 2026 17:4469,707586,953,098577,390,0001,183,0002,117,632stderr
4May 13, 2026 17:4469,742586,141,456577,742,0001,123,0002,117,632stderr
5May 13, 2026 17:4469,814589,563,979578,428,0001,035,0002,117,632stderr
6May 13, 2026 17:4469,893589,630,782579,042,0001,070,0002,117,632stderr
7May 13, 2026 17:4469,897590,898,991578,980,0001,166,0002,117,632stderr
8May 13, 2026 17:4469,898589,454,934579,004,0001,151,0002,117,632stderr
9May 13, 2026 17:4469,916589,965,296579,286,0001,022,0002,117,632stderr