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 03:28Yuriy LyfenkoYuriy LyfenkoScore: 4,682Success
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 03:284,65259,975,99837,597,0001,016,0002,478,080
2Mar 18, 2026 03:284,65365,448,66037,602,0001,016,0002,473,984
3Mar 18, 2026 03:284,65568,540,30737,622,0001,016,0002,478,080
4Mar 18, 2026 03:284,67961,076,13037,843,000995,0002,269,184
5Mar 18, 2026 03:284,68267,035,26236,871,0001,993,0002,269,184
6Mar 18, 2026 03:284,70670,094,11937,059,0002,003,0002,478,080
7Mar 18, 2026 03:284,92865,704,47038,910,0001,995,0002,531,328
8Mar 18, 2026 03:284,93171,362,28138,932,0001,996,0002,465,792
9Mar 18, 2026 03:284,93267,021,64138,936,0001,996,0002,531,328