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 19, 2026 20:27wnwnScore: 5,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 20:275,14267,309,97041,662,0001,016,0002,281,472
2Feb 19, 2026 20:275,17165,398,50840,924,0001,996,0002,281,472
3Feb 19, 2026 20:275,23363,037,02642,420,0001,010,0002,535,424