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 11, 2026 18:19olliecrowolliecrowScore: 6,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:195,93578,140,58147,247,0002,010,0002,379,776
2Feb 11, 2026 18:195,94275,511,84245,294,0004,026,0002,314,240
3Feb 11, 2026 18:196,07773,090,79949,435,0001,008,0002,478,080
4Feb 11, 2026 18:196,27980,621,36050,114,0002,004,0002,453,504
5Feb 11, 2026 18:196,48982,720,45249,868,0003,989,0002,441,216
6Feb 11, 2026 18:196,53279,826,11250,198,0004,015,0002,490,368