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 7, 2024 11:26GraceGraceScore: 45,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 11:2644,906424,935,818372,720,55402,240,512
2Jun 7, 2024 11:2644,930442,457,112372,920,41902,236,416
3Jun 7, 2024 11:2645,004434,337,095373,532,18802,240,512
4Jun 7, 2024 11:2645,031433,672,530373,755,53302,228,224
5Jun 7, 2024 11:2645,075429,592,656374,126,11602,236,416
6Jun 7, 2024 11:2645,215437,547,039375,287,92302,240,512
7Jun 7, 2024 11:2645,289440,078,154375,898,95902,244,608
8Jun 7, 2024 11:2645,406445,581,557376,868,33402,244,608
9Jun 7, 2024 11:2645,479437,063,723377,473,77902,367,488
10Jun 7, 2024 11:2645,519434,269,712377,806,06702,236,416
11Jun 7, 2024 11:2645,721441,323,987379,481,29702,240,512
12Jun 7, 2024 11:2645,924444,291,119381,172,90402,383,872