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 listFeb 27, 2026 13:32Genos0Genos0Score: 82,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 13:3282,853712,020,674544,748,000142,934,0002,363,392
2Feb 27, 2026 13:3282,946717,465,145545,567,000142,886,0002,281,472
3Feb 27, 2026 13:3283,045716,065,989544,426,000144,847,0002,400,256