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 listOct 22, 2023 23:14sliceteamsliceteamScore: 8,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2023 23:148,030100,918,93565,638,0001,009,0002,277,376
2Oct 22, 2023 23:148,03092,855,28766,645,00002,408,448
3Oct 22, 2023 23:148,03191,568,02365,648,0001,009,0002,277,376
4Oct 22, 2023 23:148,03593,271,31265,678,0001,010,0002,404,352
5Oct 22, 2023 23:148,05095,381,34864,818,0001,994,0002,277,376
6Oct 22, 2023 23:148,05489,905,66864,850,0001,995,0002,277,376
7Oct 22, 2023 23:148,05597,168,08464,863,0001,995,0002,277,376
8Oct 22, 2023 23:148,07994,688,80666,052,0001,000,0002,277,376
9Oct 22, 2023 23:148,177135,932,97567,872,79102,273,280
10Oct 22, 2023 23:148,186124,551,20167,942,81802,269,184
11Oct 22, 2023 23:148,21395,325,75168,171,00002,277,376
12Oct 22, 2023 23:148,355132,186,00169,347,36602,269,184