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 listMar 18, 2026 00:14Elijah KinElijah KinScore: 65,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 00:1465,663564,404,652489,003,00056,000,0002,482,176
2Mar 18, 2026 00:1465,681567,473,467501,137,00044,012,0002,285,568
3Mar 18, 2026 00:1465,721579,925,128494,530,00050,951,0002,486,272
4Mar 18, 2026 00:1465,734568,626,386492,629,00052,960,0002,285,568
5Mar 18, 2026 00:1465,738568,802,460484,669,00060,958,0002,285,568
6Mar 18, 2026 00:1465,762575,243,468495,839,00049,983,0002,285,568
7Mar 18, 2026 00:1465,765570,257,502485,863,00059,983,0002,469,888
8Mar 18, 2026 00:1465,793569,521,260481,076,00065,010,0002,478,080
9Mar 18, 2026 00:1465,811567,322,873487,209,00059,025,0002,486,272