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 11, 2024 07:35koenigskrautkoenigskrautScore: 111,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 00:55111,355949,806,657922,249,0001,998,0002,535,424
2Nov 11, 2024 00:55111,599953,882,102925,268,0001,000,0002,281,472
3Nov 11, 2024 00:55111,620946,229,497924,450,0001,998,0002,482,176
4Nov 11, 2024 00:55111,627948,287,813924,508,0001,998,0002,478,080
5Nov 11, 2024 00:55111,662948,577,497924,792,0001,999,0002,482,176
6Nov 11, 2024 07:35111,665951,900,949925,821,000999,0002,281,472
7Nov 11, 2024 00:55111,675951,550,042925,904,000999,0002,473,984
8Nov 11, 2024 00:55111,684952,740,068925,976,000999,0002,281,472
9Nov 11, 2024 07:35111,703949,988,359926,133,0001,000,0002,482,176
10Nov 11, 2024 07:35111,704953,785,993926,145,0001,000,0002,281,472
11Nov 11, 2024 00:55111,709952,320,508925,188,0001,998,0002,281,472
12Nov 11, 2024 00:55111,748954,317,648925,514,0001,998,0002,490,368