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 28, 2021 21:38Yuriy LyfenkoYuriy LyfenkoScore: 17,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2021 21:3817,201166,140,117141,773,000998,0002,396,160
2May 28, 2021 21:3817,209170,320,672141,836,000998,0002,498,560
3May 28, 2021 21:3817,220173,345,190141,928,000999,0002,392,064
4May 28, 2021 21:3817,222166,741,498140,944,0001,999,0002,260,992
5May 28, 2021 21:3817,223169,021,681141,956,000999,0002,260,992
6May 28, 2021 21:3817,224167,401,516140,959,0001,999,0002,260,992
7May 28, 2021 21:3817,224176,748,353141,960,000999,0002,523,136
8May 28, 2021 21:3817,329174,640,892142,834,000998,0002,387,968
9May 28, 2021 21:3817,562171,497,612143,767,0001,996,0002,379,776
10May 28, 2021 21:3817,572183,914,877145,843,96402,269,184
11May 28, 2021 21:3817,576183,836,791145,884,61502,265,088
12May 28, 2021 21:3817,577220,056,256145,886,23302,273,280