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 listApr 18, 2026 08:20Tran Anh TaiTran Anh TaiScore: 2,070,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 08:202,065,04417,170,754,38417,065,899,00073,964,0002,281,472
2Apr 18, 2026 08:202,067,11317,191,459,60917,078,069,00078,967,0002,281,472
3Apr 18, 2026 08:202,067,90217,202,107,75017,095,626,00067,958,0002,519,040
4Apr 18, 2026 08:202,069,37817,205,858,96817,118,863,00056,972,0002,281,472
5Apr 18, 2026 08:202,070,33717,229,735,99317,119,835,00063,958,0002,281,472
6Apr 18, 2026 08:202,070,38417,224,093,51617,130,222,00053,969,0002,281,472
7Apr 18, 2026 08:202,072,49217,245,280,78717,126,724,00074,959,0002,281,472
8Apr 18, 2026 08:202,094,79517,430,715,01417,304,833,00081,966,0002,281,472
9Apr 18, 2026 08:202,109,71717,544,254,52917,460,678,00049,976,0002,281,472