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 14, 2021 19:41Yuriy LyfenkoYuriy LyfenkoScore: 19,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2021 19:4119,921187,971,567164,343,0001,002,0002,260,992
2May 14, 2021 19:4119,927189,912,670165,396,00002,392,064
3May 14, 2021 19:4119,945193,350,438164,537,0001,003,0002,260,992
4May 14, 2021 19:4119,947195,744,209163,552,0002,006,0002,523,136
5May 14, 2021 19:4119,948194,494,086163,562,0002,006,0002,260,992
6May 14, 2021 19:4119,965194,217,318162,719,0002,994,0002,396,160
7May 14, 2021 19:4119,971190,488,539164,758,000998,0002,527,232
8May 14, 2021 19:4120,093191,019,018163,776,0002,995,0002,387,968
9May 14, 2021 19:4120,095196,596,644164,791,0001,997,0002,400,256