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 13, 2026 06:30e1011e1011Score: 79,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 06:3078,785665,224,781431,763,000222,160,0002,113,536
2Oct 13, 2026 06:3078,798665,318,326431,835,000222,189,0002,113,536
3Oct 13, 2026 06:3078,911666,311,208432,065,000222,902,0002,113,536
4Oct 13, 2026 06:3078,937665,888,953431,887,000223,295,0002,113,536
5Oct 13, 2026 06:3079,049667,415,096431,653,000224,460,0002,113,536
6Oct 13, 2026 06:3079,165667,708,710432,054,000225,020,0002,113,536
7Oct 13, 2026 06:3079,262669,168,264431,672,000226,206,0002,113,536
8Oct 13, 2026 06:3079,332669,130,486431,681,000226,776,0002,113,536
9Oct 13, 2026 06:3079,879673,775,622431,492,000231,504,0002,113,536