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 24, 2024 02:19MatthiasMatthiasScore: 10,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2024 02:1910,335112,928,54083,788,0001,994,0002,285,568
2Nov 24, 2024 02:1910,338116,055,89484,805,000997,0002,285,568
3Nov 24, 2024 02:1910,340111,282,18883,828,0001,995,0002,379,776
4Nov 24, 2024 02:1910,366110,674,13484,035,0002,000,0002,289,664
5Nov 24, 2024 02:1910,372114,444,09884,084,0002,002,0002,289,664
6Nov 24, 2024 02:1910,712116,504,89386,910,0001,997,0002,289,664