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 16, 2023 02:08sliceteamsliceteamScore: 17,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2023 02:0817,684173,343,315145,781,000998,0002,408,448
2Oct 16, 2023 02:0817,686177,970,468144,798,0001,997,0002,400,256
3Oct 16, 2023 02:0817,686170,220,741145,799,000998,0002,273,280
4Oct 16, 2023 02:0817,686177,203,353145,795,000998,0002,273,280
5Oct 16, 2023 02:0817,687173,920,152144,801,0001,997,0002,273,280
6Oct 16, 2023 02:0817,687177,754,260146,801,00002,273,280
7Oct 16, 2023 02:0817,690174,095,719144,830,0001,997,0002,400,256
8Oct 16, 2023 02:0817,695174,900,622145,866,000999,0002,400,256
9Oct 16, 2023 02:0818,297173,531,108149,871,0001,998,0002,396,160
10Oct 16, 2023 02:0820,623229,553,115171,170,89402,273,280
11Oct 16, 2023 02:0820,632241,072,744171,249,22302,285,568
12Oct 16, 2023 02:0820,643246,753,063171,336,27002,281,472