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 13:19zielajzielajScore: 6,817Success
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 13:196,03271,798,95550,066,00002,424,832
2Nov 11, 2024 13:196,04269,498,96849,146,0001,002,0002,428,928
3Nov 11, 2024 13:196,05274,812,68248,221,0002,009,0002,535,424
4Nov 11, 2024 13:196,81780,703,37955,567,0001,010,0002,269,184
5Nov 11, 2024 13:197,00787,484,06357,158,0001,002,0002,531,328
6Nov 11, 2024 13:197,21388,042,78157,870,0001,995,0002,269,184