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 30, 2024 23:34tkaltkalScore: 70,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2024 23:3470,073605,037,514522,643,00058,959,0002,490,368
2Dec 30, 2024 23:3470,152616,956,460530,238,00052,023,0002,273,280
3Dec 30, 2024 23:3470,156607,935,222523,265,00059,029,0002,408,448
4Dec 30, 2024 23:3470,175607,768,773526,507,00055,947,0002,273,280
5Dec 30, 2024 23:3470,191610,432,836526,627,00055,960,0002,408,448
6Dec 30, 2024 23:3470,193612,332,635525,645,00056,961,0002,273,280
7Dec 30, 2024 23:3470,207601,016,040527,742,00054,973,0002,412,544
8Dec 30, 2024 23:3470,266614,416,153529,187,00054,019,0002,273,280
9Dec 30, 2024 23:3470,382605,126,633532,156,00052,015,0002,273,280