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 listNov 12, 2024 01:45zielajzielajScore: 5,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 01:455,86378,948,56548,666,00002,433,024
2Nov 12, 2024 01:455,88276,541,72747,825,000996,0002,424,832
3Nov 12, 2024 01:455,88283,454,28847,828,000996,0002,273,280
4Nov 12, 2024 01:455,88375,606,00946,837,0001,993,0002,428,928
5Nov 12, 2024 01:455,88480,769,96248,835,00002,433,024
6Nov 12, 2024 01:455,88473,870,96748,838,00002,535,424
7Nov 12, 2024 01:455,88476,294,06346,845,0001,993,0002,424,832
8Nov 12, 2024 01:456,04478,345,72249,166,0001,003,0002,273,280
9Nov 12, 2024 01:456,06779,572,77349,347,0001,007,0002,428,928
10Nov 12, 2024 01:456,48380,222,78653,811,00002,269,184
11Nov 12, 2024 01:456,60485,121,96052,818,0001,993,0002,433,024
12Nov 12, 2024 01:456,62282,491,94653,964,000999,0002,428,928