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 02:22Victor MerckléVictor MerckléScore: 3,813Success
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 02:233,77039,691,91330,218,0001,081,0002,117,632stderr
2Aug 12, 2026 02:233,78141,120,35030,310,0001,076,0002,117,632stderr
3Aug 12, 2026 02:233,78939,817,46330,368,0001,084,0002,117,632stderr
4Aug 12, 2026 02:233,80940,067,83130,454,0001,162,0002,117,632stderr
5Aug 12, 2026 02:233,81340,021,52930,550,0001,101,0002,117,632stderr
6Aug 12, 2026 02:233,81440,043,88230,536,0001,126,0002,117,632stderr
7Aug 12, 2026 02:233,92041,051,39431,319,0001,223,0002,117,632stderr
8Aug 12, 2026 02:233,93241,046,11531,578,0001,065,0002,117,632stderr
9Aug 12, 2026 02:233,99441,554,54332,102,0001,054,0002,117,632stderr