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 28, 2026 20:35Victor MerckléVictor MerckléScore: 4,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 20:364,75347,726,85738,428,0001,022,0002,117,632stderr
2Aug 28, 2026 20:364,76548,595,65638,534,0001,021,0002,117,632stderr
3Aug 28, 2026 20:364,76748,649,89038,547,0001,021,0002,117,632stderr
4Aug 28, 2026 20:364,76948,535,20038,563,0001,022,0002,117,632stderr
5Aug 28, 2026 20:364,77148,637,15238,581,0001,021,0002,117,632stderr
6Aug 28, 2026 20:364,77648,679,02338,622,0001,022,0002,117,632stderr
7Aug 28, 2026 20:364,81349,018,76738,930,0001,025,0002,117,632stderr
8Aug 28, 2026 20:364,83549,144,50039,094,0001,044,0002,117,632stderr
9Aug 28, 2026 20:364,95350,205,60440,095,0001,022,0002,117,632stderr