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 listJul 4, 2026 12:36Joel ChongJoel ChongError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 12:36010,869,3391,428,00002,121,728expected "53682580720704630 ", got "map failed "
2Jul 4, 2026 12:36011,005,4541,436,00002,121,728expected "53692608247888531 ", got "map failed "
3Jul 4, 2026 12:36010,914,7931,454,00002,121,728expected "53688199000550448 ", got "map failed "