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 listAug 25, 2026 14:17Victor MerckléVictor MerckléScore: 7,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 14:186,95066,028,52956,602,0001,083,0002,117,632stderr
2Aug 25, 2026 14:186,95166,081,33356,554,0001,145,0002,117,632stderr
3Aug 25, 2026 14:186,98366,329,49456,884,0001,079,0002,117,632stderr
4Aug 25, 2026 14:186,98366,364,62856,881,0001,086,0002,117,632stderr
5Aug 25, 2026 14:187,07067,161,46257,654,0001,034,0002,117,632stderr
6Aug 25, 2026 14:187,11067,374,35757,928,0001,086,0002,117,632stderr
7Aug 25, 2026 14:187,14667,673,12258,233,0001,083,0002,117,632stderr
8Aug 25, 2026 14:187,21968,415,54458,855,0001,066,0002,117,632stderr
9Aug 25, 2026 14:187,23168,433,42558,934,0001,087,0002,117,632stderr