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 listOct 27, 2025 02:06Weitao WanWeitao WanScore: 72,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 02:0672,145618,486,386597,808,000999,0002,281,472
2Oct 27, 2025 02:0672,151623,716,825596,857,0001,999,0002,269,184
3Oct 27, 2025 02:0672,151622,864,452596,854,0001,999,0002,269,184
4Oct 27, 2025 02:0672,153622,712,346596,872,0001,999,0002,285,568
5Oct 27, 2025 02:0672,156624,057,290596,895,0001,999,0002,265,088
6Oct 27, 2025 02:0672,173624,572,504597,038,0002,000,0002,285,568
7Oct 27, 2025 02:0672,183624,846,539597,117,0002,000,0002,285,568
8Oct 27, 2025 02:0672,184623,496,653598,129,0001,000,0002,285,568
9Oct 27, 2025 02:0672,326627,269,481597,306,0003,001,0002,285,568