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 26, 2026 20:39Victor MerckléVictor MerckléScore: 3,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:403,79240,532,43130,278,0001,196,0002,117,632stderr
2Aug 26, 2026 20:403,81239,835,77130,501,0001,141,0002,117,632stderr
3Aug 26, 2026 20:403,82240,046,44330,656,0001,072,0002,117,632stderr
4Aug 26, 2026 20:403,82739,879,57030,695,0001,076,0002,117,632stderr
5Aug 26, 2026 20:403,83840,914,62930,727,0001,131,0002,117,632stderr
6Aug 26, 2026 20:403,84641,013,61930,705,0001,225,0002,117,632stderr
7Aug 26, 2026 20:403,90940,628,05131,382,0001,069,0002,117,632stderr
8Aug 26, 2026 20:404,00042,133,31232,127,0001,076,0002,117,632stderr
9Aug 26, 2026 20:404,55755,061,90236,648,0001,177,0002,117,632stderr