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 listNov 6, 2024 17:17Dan StolyarovDan StolyarovScore: 64,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 17:1763,826562,670,084469,781,00059,972,0002,281,472
2Nov 6, 2024 17:1763,841559,147,553473,891,00055,987,0002,269,184
3Nov 6, 2024 17:1763,867558,154,408475,087,00055,010,0002,371,584
4Nov 6, 2024 17:1763,890554,379,295473,258,00057,031,0002,293,760
5Nov 6, 2024 17:1764,003555,073,033472,200,00059,025,0002,281,472
6Nov 6, 2024 17:1764,054556,788,189474,689,00056,962,0002,289,664
7Nov 6, 2024 17:1764,072560,920,688473,823,00057,978,0002,289,664
8Nov 6, 2024 17:1764,095559,603,072468,990,00062,998,0002,514,944
9Nov 6, 2024 17:1764,498567,426,832470,294,00065,040,0002,269,184