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:17Victor MerckléVictor MerckléScore: 3,906Success
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:193,85040,408,55330,798,0001,161,0002,117,632stderr
2Aug 25, 2026 00:193,87040,475,29831,044,0001,084,0002,117,632stderr
3Aug 25, 2026 00:193,87940,559,99931,010,0001,191,0002,117,632stderr
4Aug 25, 2026 00:193,89940,799,85931,228,0001,141,0002,117,632stderr
5Aug 25, 2026 00:193,90640,828,41831,317,0001,104,0002,117,632stderr
6Aug 25, 2026 00:193,95141,267,97531,668,0001,129,0002,117,632stderr
7Aug 25, 2026 00:193,95141,211,95031,691,0001,107,0002,117,632stderr
8Aug 25, 2026 00:193,97441,397,61231,885,0001,105,0002,117,632stderr
9Aug 25, 2026 00:194,03141,871,78332,394,0001,064,0002,117,632stderr