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 12, 2026 08:27Victor MerckléVictor MerckléScore: 3,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 08:283,84040,306,01930,745,0001,131,0002,117,632stderr
2Aug 12, 2026 08:283,86140,224,50031,030,0001,018,0002,117,632stderr
3Aug 12, 2026 08:283,87740,617,30031,079,0001,105,0002,117,632stderr
4Aug 12, 2026 08:283,87940,377,57331,112,0001,088,0002,117,632stderr
5Aug 12, 2026 08:283,87940,648,76531,083,0001,120,0002,117,632stderr
6Aug 12, 2026 08:283,88540,438,21731,130,0001,121,0002,117,632stderr
7Aug 12, 2026 08:283,90240,784,73231,251,0001,139,0002,117,632stderr
8Aug 12, 2026 08:284,08042,297,44532,759,0001,112,0002,117,632stderr
9Aug 12, 2026 08:284,17542,819,05333,554,0001,106,0002,117,632stderr