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 10, 2026 17:51Victor MerckléVictor MerckléScore: 3,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 17:533,89040,714,37831,087,0001,201,0002,117,632stderr
2Aug 10, 2026 17:533,89840,961,66431,151,0001,209,0002,117,632stderr
3Aug 10, 2026 17:533,90640,852,27231,200,0001,228,0002,117,632stderr
4Aug 10, 2026 17:533,90740,767,84531,236,0001,199,0002,117,632stderr
5Aug 10, 2026 17:533,90741,456,03531,236,0001,197,0002,117,632stderr
6Aug 10, 2026 17:533,91340,783,56931,302,0001,184,0002,117,632stderr
7Aug 10, 2026 17:533,91840,922,47931,403,0001,122,0002,117,632stderr
8Aug 10, 2026 17:533,93241,044,29331,441,0001,196,0002,117,632stderr
9Aug 10, 2026 17:533,93541,038,86631,645,0001,020,0002,117,632stderr