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 listFeb 27, 2026 04:03user76135user76135Score: 68,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 04:0368,530592,245,665511,821,00056,980,0002,277,376
2Feb 27, 2026 04:0368,635590,826,741509,706,00059,965,0002,277,376
3Feb 27, 2026 04:0368,697595,587,936509,169,00061,020,0002,289,664
4Feb 27, 2026 04:0368,716599,670,227509,412,00060,929,0002,277,376
5Feb 27, 2026 04:0368,733593,608,245512,535,00057,947,0002,277,376
6Feb 27, 2026 04:0368,757593,622,503506,722,00063,964,0002,277,376
7Feb 27, 2026 04:0368,768591,587,643509,801,00060,976,0002,502,656
8Feb 27, 2026 04:0368,773594,748,978506,836,00063,979,0002,277,376
9Feb 27, 2026 04:0368,776597,005,411510,857,00059,983,0002,277,376