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 24, 2026 04:48servant714servant714Score: 63,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 04:4863,135548,210,856466,019,00058,002,0002,281,472
2Mar 24, 2026 04:4863,191552,169,052469,432,00055,050,0002,441,216
3Mar 24, 2026 04:4863,221548,162,262464,764,00059,969,0002,273,280
4Mar 24, 2026 04:4863,224553,048,193471,785,00052,975,0002,424,832
5Mar 24, 2026 04:4863,228548,295,505465,817,00058,976,0002,281,472
6Mar 24, 2026 04:4863,255550,865,653463,014,00062,001,0002,281,472
7Mar 24, 2026 04:4863,288550,846,187472,265,00053,029,0002,420,736
8Mar 24, 2026 04:4863,439553,827,840469,591,00056,950,0002,416,640
9Mar 24, 2026 04:4863,451549,833,115468,685,00057,961,0002,428,928