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 02:29zielajzielajScore: 3,727Success
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 02:293,59860,552,59527,875,0001,991,0002,527,232
2Nov 15, 2024 02:293,59959,532,50227,884,0001,991,0002,527,232
3Nov 15, 2024 02:293,61657,236,34929,010,0001,000,0002,527,232
4Nov 15, 2024 02:293,72756,747,72029,939,000997,0002,531,328
5Nov 15, 2024 02:293,76256,228,82330,216,0001,007,0002,359,296
6Nov 15, 2024 02:293,80954,853,87331,615,00002,355,200