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 9, 2025 18:49vahookvahookScore: 7,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2025 18:497,15482,458,01756,357,0003,019,0002,265,088
2May 9, 2025 18:497,15980,985,10657,404,0002,014,0002,441,216
3May 9, 2025 18:497,17784,346,57253,513,0006,058,0002,265,088
4May 9, 2025 18:497,18085,154,22457,577,0002,020,0002,527,232
5May 9, 2025 18:497,20390,142,51057,795,0001,992,0002,404,352
6May 9, 2025 18:497,25186,631,29655,167,0005,015,0002,265,088
7May 9, 2025 18:497,25888,312,88055,223,0005,020,0002,527,232
8May 9, 2025 18:497,29181,855,28058,497,0002,017,0002,408,448
9May 9, 2025 18:497,29390,497,89355,488,0005,044,0002,527,232
10May 9, 2025 18:497,30784,922,48658,630,0002,021,0002,408,448
11May 9, 2025 18:497,32786,070,83758,823,0001,994,0002,527,232
12May 9, 2025 18:497,36083,863,70658,085,0003,004,0002,400,256