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 09:41Victor MerckléVictor MerckléScore: 5,183Success
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 09:425,13751,055,75041,545,0001,093,0002,117,632stderr
2Aug 12, 2026 09:425,13850,800,39341,523,0001,127,0002,117,632stderr
3Aug 12, 2026 09:425,14651,106,20041,625,0001,088,0002,117,632stderr
4Aug 12, 2026 09:425,18351,450,30541,961,0001,065,0002,117,632stderr
5Aug 12, 2026 09:425,18351,389,18241,977,0001,042,0002,117,632stderr
6Aug 12, 2026 09:425,18651,488,50541,928,0001,116,0002,117,632stderr
7Aug 12, 2026 09:425,19551,552,04642,066,0001,060,0002,117,632stderr
8Aug 12, 2026 09:425,21051,662,26442,207,0001,044,0002,117,632stderr
9Aug 12, 2026 09:425,31852,352,85043,065,0001,080,0002,117,632stderr