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 listSep 20, 2025 08:50sheryllynn24sheryllynn24Score: 10,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 08:5010,729121,146,43887,049,0002,001,0002,523,136
2Sep 20, 2025 08:5010,752115,180,75188,242,0001,002,0002,265,088
3Sep 20, 2025 08:5010,753114,377,21087,248,0002,005,0002,285,568
4Sep 20, 2025 08:5010,770113,656,85887,386,0002,008,0002,285,568
5Sep 20, 2025 08:5010,773112,631,95189,417,00002,265,088
6Sep 20, 2025 08:5010,787111,718,29988,526,0001,005,0002,285,568