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 listApr 29, 2026 14:02olliecrowolliecrowScore: 9,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 14:059,28885,281,05272,090,0005,006,0002,367,488
2Apr 29, 2026 14:059,29385,380,96275,132,0002,003,0002,506,752
3Apr 29, 2026 14:059,40686,246,80176,076,0002,002,0002,564,096
4Apr 29, 2026 14:059,42586,326,16174,221,0004,011,0002,453,504
5Apr 29, 2026 14:059,47786,802,31074,630,0004,034,0002,568,192
6Apr 29, 2026 14:059,50387,091,33275,888,0002,995,0002,478,080
7Apr 29, 2026 14:059,69788,699,91277,473,0003,018,0002,314,240
8Apr 29, 2026 14:059,73087,977,07677,772,0002,991,0002,547,712
9Apr 29, 2026 14:059,79689,605,53376,296,0005,019,0002,465,792