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 listDec 15, 2025 10:25Shikhar SoniShikhar SoniScore: 83,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 00:4082,621710,703,240465,833,000219,921,0002,260,992
2Dec 8, 2025 00:4082,665718,706,360464,404,000221,715,0002,351,104
3Dec 8, 2025 00:4082,740708,040,846463,827,000222,917,0002,260,992
4Dec 8, 2025 00:4082,753714,046,193464,896,000221,950,0002,260,992
5Dec 8, 2025 00:4082,969711,598,980464,757,000223,883,0002,510,848
6Dec 8, 2025 00:4083,042712,856,877463,497,000225,755,0002,416,640
7Dec 8, 2025 00:4083,049714,935,206463,534,000225,773,0002,289,664
8Dec 8, 2025 00:4083,075716,701,593464,676,000224,843,0002,314,240
9Dec 8, 2025 00:4083,117717,126,406464,914,000224,958,0002,510,848
10Dec 15, 2025 10:2583,152712,068,933465,436,000224,727,0002,314,240
11Dec 15, 2025 10:2583,160715,453,344464,478,000225,746,0002,494,464
12Dec 15, 2025 10:2583,161715,144,800463,489,000226,750,0002,314,240