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 15, 2024 01:07zielajzielajScore: 3,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 01:073,91655,102,94731,485,0001,015,0002,355,200
2Nov 15, 2024 01:073,91758,174,56731,496,0001,016,0002,535,424
3Nov 15, 2024 01:073,92661,210,47632,582,00002,359,296
4Nov 15, 2024 01:073,96858,763,15731,936,000998,0002,367,488
5Nov 15, 2024 01:073,98759,530,14232,094,0001,002,0002,277,376
6Nov 15, 2024 01:074,10558,116,18332,067,0002,004,0002,277,376