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 16, 2026 05:44e1011e1011Score: 55,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 05:4554,896466,312,971454,476,0001,161,0002,113,536
2Oct 16, 2026 05:4555,007467,224,759455,371,0001,194,0002,113,536
3Oct 16, 2026 05:4555,007467,212,993455,309,0001,250,0002,113,536
4Oct 16, 2026 05:4555,495471,279,029459,611,0001,002,0002,113,536
5Oct 16, 2026 05:4555,644472,494,632460,846,0001,003,0002,113,536
6Oct 16, 2026 05:4555,803473,747,489462,015,0001,155,0002,113,536
7Oct 16, 2026 05:4556,002475,962,474463,815,0001,004,0002,113,536
8Oct 16, 2026 05:4556,029475,703,447463,913,0001,128,0002,113,536
9Oct 16, 2026 05:4556,040476,391,849464,132,0001,004,0002,113,536