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 17, 2026 18:58wnwnScore: 7,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 18:587,39884,061,88458,385,0003,019,0002,457,600
2Feb 17, 2026 18:587,45988,745,58357,913,0003,994,0002,428,928
3Feb 17, 2026 18:587,46391,221,76659,941,0001,998,0002,322,432
4Feb 17, 2026 18:587,48889,082,96757,141,0005,012,0002,420,736
5Feb 17, 2026 18:587,54289,236,70359,570,0003,029,0002,383,872
6Feb 17, 2026 18:587,570102,360,25559,836,0002,991,0002,396,160
7Feb 17, 2026 18:587,57689,730,96859,885,0002,994,0002,428,928
8Feb 17, 2026 18:587,68597,947,55860,793,0002,989,0002,420,736
9Feb 17, 2026 18:587,70086,681,86962,909,000998,0002,428,928