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 10, 2026 10:52Danylo MocherniukDanylo MocherniukScore: 4,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 10:524,85165,255,29939,259,0001,006,0002,297,856
2Apr 10, 2026 10:524,89669,541,96839,620,0001,015,0002,297,856
3Apr 10, 2026 10:524,89770,945,77038,614,0002,032,0002,387,968
4Apr 10, 2026 10:524,90068,074,60339,655,0001,016,0002,396,160
5Apr 10, 2026 10:524,91766,882,67538,818,0001,990,0002,387,968
6Apr 10, 2026 10:524,92068,098,16637,846,0002,987,0002,400,256
7Apr 10, 2026 10:524,92169,728,69637,858,0002,988,0002,297,856
8Apr 10, 2026 10:524,93062,964,13838,921,0001,995,0002,396,160
9Apr 10, 2026 10:524,93270,164,33438,942,0001,997,0002,297,856
10Apr 10, 2026 10:524,97966,056,00638,301,0003,023,0002,392,064
11Apr 10, 2026 10:525,04469,916,03239,869,0001,993,0002,482,176
12Apr 10, 2026 10:525,13372,427,78639,564,0003,043,0002,392,064