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 00:03Victor MerckléVictor MerckléScore: 3,822Success
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 00:043,80840,025,13130,431,0001,183,0002,117,632stderr
2Aug 25, 2026 00:043,80839,956,54930,531,0001,082,0002,117,632stderr
3Aug 25, 2026 00:043,80939,977,77130,537,0001,083,0002,117,632stderr
4Aug 25, 2026 00:043,82240,150,76330,642,0001,081,0002,117,632stderr
5Aug 25, 2026 00:043,82240,068,48830,659,0001,067,0002,117,632stderr
6Aug 25, 2026 00:043,82340,076,88730,653,0001,081,0002,117,632stderr
7Aug 25, 2026 00:043,85840,382,49830,939,0001,089,0002,117,632stderr
8Aug 25, 2026 00:043,98941,484,56031,983,0001,126,0002,117,632stderr
9Aug 25, 2026 00:044,01441,648,39932,310,0001,014,0002,117,632stderr