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 13, 2025 19:42Tony SolomonikTony SolomonikScore: 49,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2025 19:4249,777438,121,054350,123,00063,022,0002,289,664
2Sep 13, 2025 19:4249,799438,221,330351,285,00062,050,0002,359,296
3Sep 13, 2025 19:4249,829439,543,034349,649,00063,935,0002,285,568
4Sep 13, 2025 19:4249,836444,544,352350,691,00062,944,0002,351,104
5Sep 13, 2025 19:4249,850438,515,455349,796,00063,962,0002,351,104
6Sep 13, 2025 19:4249,868441,047,599350,919,00062,985,0002,281,472
7Sep 13, 2025 19:4249,882443,521,633353,015,00061,002,0002,289,664
8Sep 13, 2025 19:4249,948441,121,830353,629,00060,936,0002,355,200
9Sep 13, 2025 19:4250,022437,857,869351,153,00064,027,0002,355,200