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:30koenigskrautkoenigskrautScore: 115,060Success
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:30115,031981,536,681953,757,000999,0002,478,080
2Nov 11, 2024 00:30115,031979,416,058953,762,000999,0002,281,472
3Nov 11, 2024 00:30115,047978,639,355953,890,000999,0002,535,424
4Nov 11, 2024 00:30115,049980,389,252953,910,000999,0002,482,176
5Nov 11, 2024 00:30115,060985,770,354953,999,000999,0002,478,080
6Nov 11, 2024 00:30115,069978,366,550954,070,0001,000,0002,535,424
7Nov 11, 2024 00:30115,071981,067,606954,086,0001,000,0002,482,176
8Nov 11, 2024 00:30115,122977,544,682953,514,0001,998,0002,281,472
9Nov 11, 2024 00:30115,142983,208,790953,681,0001,999,0002,478,080