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 19, 2024 00:55zielajzielajScore: 3,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2024 00:553,52354,590,61728,229,0001,008,0002,371,584
2Nov 19, 2024 00:553,52948,117,95828,281,0001,010,0002,355,200
3Nov 19, 2024 01:003,53650,196,81929,348,00002,367,488
4Nov 19, 2024 00:553,54654,798,78928,417,0001,014,0002,523,136
5Nov 19, 2024 01:003,55152,356,09228,454,0001,016,0002,371,584
6Nov 19, 2024 01:003,61656,576,99729,009,0001,000,0002,523,136
7Nov 19, 2024 00:553,69457,540,44930,662,00002,387,968
8Nov 19, 2024 01:003,69565,796,42930,669,00002,375,680
9Nov 19, 2024 01:003,69755,122,37329,662,0001,022,0002,531,328
10Nov 19, 2024 01:003,72653,102,58228,930,0001,995,0002,531,328
11Nov 19, 2024 00:554,02956,992,69133,438,00002,371,584
12Nov 19, 2024 00:554,32960,523,89433,991,0001,942,0002,531,328