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 00:20koenigskrautkoenigskrautScore: 115,536Success
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:20115,358984,048,552955,477,0001,998,0002,535,424
2Nov 11, 2024 00:20115,404982,532,817956,857,000999,0002,281,472
3Nov 11, 2024 00:20115,500979,443,869956,647,0001,999,0002,281,472
4Nov 11, 2024 00:20115,514982,935,543957,769,000999,0002,281,472
5Nov 11, 2024 00:20115,536981,084,485957,950,000999,0002,281,472
6Nov 11, 2024 00:20115,553990,676,194958,086,0001,000,0002,535,424
7Nov 11, 2024 00:20115,596979,677,680957,452,0001,998,0002,482,176
8Nov 11, 2024 00:20117,416997,186,833972,556,0001,999,0002,535,424
9Nov 11, 2024 00:20147,9501,254,100,3771,226,990,000999,0002,281,472