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 listJul 7, 2026 04:41wnwnScore: 3,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:483,31035,328,89126,453,0001,026,0002,113,536
2Jul 7, 2026 04:483,37235,807,70326,981,0001,008,0002,113,536
3Jul 7, 2026 04:483,39936,048,49327,210,0001,009,0002,113,536
4Jul 7, 2026 04:483,42736,954,79527,409,0001,040,0002,113,536
5Jul 7, 2026 04:483,44337,059,95927,541,0001,041,0002,113,536
6Jul 7, 2026 04:483,45136,490,82927,596,0001,052,0002,113,536
7Jul 7, 2026 04:483,45136,452,21627,613,0001,038,0002,113,536
8Jul 7, 2026 04:483,48537,476,05127,904,0001,029,0002,113,536
9Jul 7, 2026 04:483,50037,546,44328,043,0001,009,0002,113,536