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 listSep 13, 2026 21:17Victor MerckléVictor MerckléScore: 4,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 21:194,78358,974,38638,607,0001,100,0002,117,632stderr
2Sep 13, 2026 21:194,83060,549,71039,050,0001,045,0002,117,632stderr
3Sep 13, 2026 21:194,84749,901,18539,169,0001,069,0002,117,632stderr
4Sep 13, 2026 21:194,92550,447,99439,804,0001,078,0002,117,632stderr
5Sep 13, 2026 21:194,92553,088,84839,825,0001,054,0002,117,632stderr
6Sep 13, 2026 21:194,95858,518,46140,050,0001,108,0002,117,632stderr
7Sep 13, 2026 21:194,97960,718,34640,226,0001,101,0002,117,632stderr
8Sep 13, 2026 21:194,98751,922,87840,333,0001,064,0002,117,632stderr
9Sep 13, 2026 21:195,04358,743,87940,741,0001,122,0002,117,632stderr