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 listJun 30, 2021 21:31Yuriy LyfenkoYuriy LyfenkoScore: 14,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2021 21:3114,264430,197,626118,393,99502,240,512
2Jun 30, 2021 21:3114,279442,794,100118,513,50002,244,608
3Jun 30, 2021 21:3114,292428,720,691118,620,59902,269,184
4Jun 30, 2021 21:3114,777400,686,581120,659,0001,994,0002,260,992
5Jun 30, 2021 21:3114,779401,200,716120,673,0001,994,0002,260,992
6Jun 30, 2021 21:3114,781400,405,139120,689,0001,994,0002,260,992
7Jun 30, 2021 21:3114,783401,224,489121,705,000997,0002,260,992
8Jun 30, 2021 21:3114,791397,509,968121,767,000998,0002,523,136
9Jun 30, 2021 21:3114,805398,725,709120,880,0001,998,0002,523,136
10Jun 30, 2021 21:3114,806399,218,836121,891,000999,0002,392,064
11Jun 30, 2021 21:3114,807402,642,819121,902,000999,0002,260,992
12Jun 30, 2021 21:3114,824396,383,865121,038,0002,000,0002,387,968