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 16:47Victor MerckléVictor MerckléScore: 5,457Success
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 16:475,33252,574,63043,210,0001,047,0002,117,632stderr
2Aug 26, 2026 16:475,35852,603,12243,449,0001,029,0002,117,632stderr
3Aug 26, 2026 16:475,40853,036,12543,884,0001,006,0002,117,632stderr
4Aug 26, 2026 16:475,41153,083,15843,883,0001,033,0002,117,632stderr
5Aug 26, 2026 16:475,45753,481,04944,251,0001,044,0002,117,632stderr
6Aug 26, 2026 16:475,51354,588,57844,726,0001,037,0002,117,632stderr
7Aug 26, 2026 16:475,53955,044,77444,927,0001,053,0002,117,632stderr
8Aug 26, 2026 16:475,55955,239,06745,100,0001,046,0002,117,632stderr
9Aug 26, 2026 16:475,60354,808,04845,462,0001,048,0002,117,632stderr