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 26, 2026 20:43Victor MerckléVictor MerckléScore: 7,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:437,02967,427,45157,178,0001,166,0002,117,632stderr
2Aug 26, 2026 20:437,06067,045,35557,430,0001,176,0002,117,632stderr
3Aug 26, 2026 20:437,06967,019,01957,539,0001,139,0002,117,632stderr
4Aug 26, 2026 20:437,07866,875,65457,721,0001,028,0002,117,632stderr
5Aug 26, 2026 20:437,08167,130,44057,693,0001,083,0002,117,632stderr
6Aug 26, 2026 20:437,08967,852,79757,731,0001,115,0002,117,632stderr
7Aug 26, 2026 20:437,11367,388,05457,950,0001,088,0002,117,632stderr
8Aug 26, 2026 20:437,19468,077,87358,638,0001,080,0002,117,632stderr
9Aug 26, 2026 20:437,36370,193,29560,023,0001,096,0002,117,632stderr