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 6, 2026 16:04Danylo MocherniukDanylo MocherniukScore: 6,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 16:046,34080,945,31151,613,0001,012,0002,506,752
2Apr 6, 2026 16:046,34278,307,58149,600,0003,036,0002,314,240
3Apr 6, 2026 16:046,34681,903,14650,643,0002,025,0002,506,752
4Apr 6, 2026 16:046,36176,527,85849,808,0002,988,0002,314,240
5Apr 6, 2026 16:046,36578,928,36650,839,0001,993,0002,502,656
6Apr 6, 2026 16:046,36877,930,32149,865,0002,991,0002,314,240
7Apr 6, 2026 16:046,37077,322,93949,877,0002,992,0002,502,656
8Apr 6, 2026 16:046,37875,341,46549,944,0002,996,0002,506,752
9Apr 6, 2026 16:046,38277,052,04849,971,0002,998,0002,314,240
10Apr 6, 2026 16:046,41374,530,23550,219,0003,013,0002,314,240
11Apr 6, 2026 16:046,41475,278,99150,224,0003,013,0002,314,240
12Apr 6, 2026 16:046,47079,025,38752,690,0001,013,0002,519,040