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 20:22Joel SmithJoel SmithScore: 112,732Success
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 20:22112,700958,879,984876,448,00058,962,0002,277,376
2Mar 18, 2026 20:22112,703960,172,711886,461,00048,970,0002,473,984
3Mar 18, 2026 20:22112,711958,752,921873,538,00061,967,0002,277,376
4Mar 18, 2026 20:22112,727960,500,889873,657,00061,975,0002,478,080
5Mar 18, 2026 20:22112,732959,440,670870,702,00064,977,0002,473,984
6Mar 18, 2026 20:22112,780962,733,877886,067,00050,003,0002,285,568
7Mar 18, 2026 20:22112,810962,160,386889,355,00046,965,0002,277,376
8Mar 18, 2026 20:22112,811961,578,478880,370,00055,960,0002,469,888
9Mar 18, 2026 20:22112,828966,097,581872,511,00063,964,0002,285,568