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 11, 2026 21:35Victor MerckléVictor MerckléScore: 3,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 21:363,83940,144,77830,824,0001,041,0002,117,632stderr
2Aug 11, 2026 21:363,84540,326,13830,746,0001,172,0002,117,632stderr
3Aug 11, 2026 21:363,85140,416,53430,832,0001,136,0002,117,632stderr
4Aug 11, 2026 21:363,85240,423,64330,830,0001,147,0002,117,632stderr
5Aug 11, 2026 21:363,85240,466,69430,931,0001,043,0002,117,632stderr
6Aug 11, 2026 21:363,87140,583,64130,930,0001,202,0002,117,632stderr
7Aug 11, 2026 21:363,88240,570,97031,126,0001,096,0002,117,632stderr
8Aug 11, 2026 21:363,92840,995,59931,551,0001,055,0002,117,632stderr
9Aug 11, 2026 21:364,05842,073,22832,642,0001,046,0002,117,632stderr