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 23:13Victor MerckléVictor MerckléScore: 3,853Success
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 23:143,80140,403,86930,373,0001,180,0002,117,632stderr
2Aug 12, 2026 23:143,80240,042,37230,380,0001,177,0002,117,632stderr
3Aug 12, 2026 23:143,81040,048,52030,513,0001,118,0002,117,632stderr
4Aug 12, 2026 23:143,82040,207,21930,600,0001,113,0002,117,632stderr
5Aug 12, 2026 23:143,85340,444,81730,842,0001,146,0002,117,632stderr
6Aug 12, 2026 23:143,89840,838,20331,219,0001,137,0002,117,632stderr
7Aug 12, 2026 23:143,90240,835,39431,309,0001,083,0002,117,632stderr
8Aug 12, 2026 23:143,91940,961,61231,511,0001,018,0002,117,632stderr
9Aug 12, 2026 23:144,00541,653,25532,168,0001,078,0002,117,632stderr