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 17, 2026 03:14Victor MerckléVictor MerckléScore: 27,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 03:1727,546238,492,546227,531,0001,101,0002,117,632stderr
2Sep 17, 2026 03:1727,596238,998,951227,922,0001,126,0002,117,632stderr
3Sep 17, 2026 03:1727,612238,836,049228,079,0001,106,0002,117,632stderr
4Sep 17, 2026 03:1727,634239,838,415228,247,0001,119,0002,117,632stderr
5Sep 17, 2026 03:1727,643239,461,859228,422,0001,017,0002,117,632stderr
6Sep 17, 2026 03:1727,644240,091,863228,359,0001,093,0002,117,632stderr
7Sep 17, 2026 03:1727,695239,940,144228,862,0001,010,0002,117,632stderr
8Sep 17, 2026 03:1727,709240,081,251228,881,0001,105,0002,117,632stderr
9Sep 17, 2026 03:1727,726240,710,793229,019,0001,108,0002,117,632stderr