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 21, 2021 09:50Andrei GrazhdankovAndrei GrazhdankovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2021 07:4000000no run stats recorded
2May 1, 2021 10:3100000no run stats recorded
3May 24, 2021 06:1274,575683,671,565618,973,72002,293,760
4May 24, 2021 06:1274,609686,799,161619,255,90602,285,568
5May 21, 2021 09:5074,628690,621,141619,408,98702,269,184
6May 24, 2021 06:1274,644675,390,324619,546,71102,289,664
7May 21, 2021 09:5074,688687,978,493619,910,78102,277,376
8May 21, 2021 09:5074,698697,179,168619,995,09402,277,376
9May 21, 2021 09:5074,743686,376,497620,367,89102,281,472
10May 21, 2021 09:5074,759685,459,593620,503,24802,281,472
11May 21, 2021 09:5074,814688,451,742620,956,21502,285,568