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 4, 2021 22:37Yuriy LyfenkoYuriy LyfenkoScore: 23,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2021 22:3723,169219,354,474191,304,0001,001,0002,396,160
2May 4, 2021 22:3723,174214,474,413191,341,0001,001,0002,387,968
3May 4, 2021 22:3723,175216,591,339192,349,00002,260,992
4May 4, 2021 22:3723,184216,349,479191,429,0001,002,0002,260,992
5May 4, 2021 22:3723,186213,460,269192,440,00002,387,968
6May 4, 2021 22:3723,187217,745,230191,447,0001,002,0002,260,992
7May 4, 2021 22:3723,194226,275,781192,509,00002,265,088
8May 4, 2021 22:3723,207219,186,520191,614,0001,003,0002,387,968
9May 4, 2021 22:3723,221214,303,539191,740,000998,0002,506,752