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 listMay 21, 2025 17:35vahookvahookScore: 5,099Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2025 17:355,04563,000,37839,879,0001,993,0002,424,832
2May 21, 2025 17:355,09459,895,23538,252,0004,026,0002,428,928
3May 21, 2025 17:355,09465,239,59440,265,0002,013,0002,428,928
4May 21, 2025 17:355,09965,750,79640,310,0002,015,0002,527,232
5May 21, 2025 17:355,15868,839,88738,829,0003,982,0002,465,792
6May 21, 2025 17:355,16066,775,30338,844,0003,984,0002,428,928