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 listOct 13, 2024 23:51Joad NacerJoad NacerScore: 7,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 23:517,19188,732,08757,665,0002,023,0002,306,048
2Oct 13, 2024 23:517,20983,049,90358,836,000997,0002,297,856
3Oct 13, 2024 23:517,21388,660,24958,870,000997,0002,301,952
4Oct 13, 2024 23:517,35086,231,25059,009,0002,000,0002,306,048
5Oct 13, 2024 23:517,41482,726,82960,527,0001,008,0002,379,776
6Oct 13, 2024 23:517,46186,386,71860,930,000998,0002,269,184