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 14, 2026 18:09Elijah KinElijah KinScore: 66,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 18:0966,308576,311,045499,323,00051,033,0002,506,752
2Mar 14, 2026 18:0966,321579,202,535486,525,00063,937,0002,277,376
3Mar 14, 2026 18:0966,321578,108,899493,520,00056,944,0002,285,568
4Mar 14, 2026 18:0966,347578,086,029493,711,00056,966,0002,506,752
5Mar 14, 2026 18:0966,396578,906,976494,079,00057,009,0002,506,752
6Mar 14, 2026 18:0966,436579,611,733476,362,00075,057,0002,285,568
7Mar 14, 2026 18:0966,472576,018,662487,748,00063,967,0002,347,008
8Mar 14, 2026 18:0966,492583,492,006516,891,00034,992,0002,506,752
9Mar 14, 2026 18:0966,493576,468,306483,902,00067,986,0002,514,944