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 listMay 17, 2021 20:11Yuriy LyfenkoYuriy LyfenkoScore: 19,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 20:1119,043182,649,521157,054,0001,000,0002,260,992
2May 17, 2021 20:1119,063183,954,354156,218,0002,002,0002,396,160
3May 17, 2021 20:1119,076184,338,988157,339,000995,0002,260,992
4May 17, 2021 20:1119,095181,369,537157,483,0001,003,0002,392,064
5May 17, 2021 20:1119,108188,536,110156,590,0002,007,0002,392,064
6May 17, 2021 20:1119,190187,978,069159,280,00002,260,992
7May 17, 2021 20:1119,191181,884,238157,280,0002,003,0002,260,992
8May 17, 2021 20:1119,193184,124,509157,295,0002,003,0002,260,992
9May 17, 2021 20:1119,209181,060,335158,433,0001,002,0002,260,992