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 21:37Victor MerckléVictor MerckléScore: 5,480Success
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 21:385,45753,705,98344,270,0001,026,0002,117,632stderr
2Aug 25, 2026 21:385,46253,695,58344,323,0001,014,0002,117,632stderr
3Aug 25, 2026 21:385,46253,757,02844,319,0001,018,0002,117,632stderr
4Aug 25, 2026 21:385,46754,080,24244,362,0001,017,0002,117,632stderr
5Aug 25, 2026 21:385,48053,830,94144,471,0001,018,0002,117,632stderr
6Aug 25, 2026 21:385,49954,076,28144,547,0001,097,0002,117,632stderr
7Aug 25, 2026 21:385,50354,090,49644,625,0001,053,0002,117,632stderr
8Aug 25, 2026 21:385,52655,416,83044,861,0001,005,0002,117,632stderr
9Aug 25, 2026 21:385,54854,435,91045,031,0001,025,0002,117,632stderr