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 31, 2026 14:48Yuriy LyfenkoYuriy LyfenkoScore: 4,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 14:484,69769,899,98936,988,0001,999,0002,314,240
2Mar 31, 2026 14:484,70567,579,98437,046,0002,002,0002,465,792
3Mar 31, 2026 14:484,93067,599,37138,920,0001,995,0002,535,424