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 11, 2024 14:05Dmitrii KravchenkoDmitrii KravchenkoScore: 90,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2024 14:0590,441774,195,918540,756,000209,905,0002,473,984
2Sep 11, 2024 14:0590,484780,284,201526,314,000224,707,0002,371,584
3Sep 11, 2024 14:0590,621782,009,824528,408,000223,749,0002,351,104
4Sep 11, 2024 14:0590,691780,253,992526,817,000225,921,0002,301,952
5Sep 11, 2024 14:0590,721780,817,477519,299,000233,684,0002,445,312
6Sep 11, 2024 14:0590,995778,307,464528,481,000226,777,0002,379,776
7Sep 11, 2024 14:0591,130778,348,178529,566,000226,814,0002,383,872
8Sep 11, 2024 14:0591,293780,889,405530,813,000226,920,0002,371,584
9Sep 11, 2024 14:0591,725785,152,245526,527,000234,789,0002,392,064